2024 University of Shanghai for Science and Technology(USST) Freshman Challenge Contest
13 problems from 2024 University of Shanghai for Science and Technology(USST) Freshman Challenge Contest (contest 105160), difficulty -. 11/13 solutions verified against sample I/O.
2024 University of Shanghai for Science and Technology(USST) Freshman Challenge Contest
Special | 13 problems | 11/13 verified | Difficulty - | 10m 51s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | \u6211\u662f\u7ec4\u9898\u4eba | 51s | ✓ | |||
| B | \u4fc4\u7f57\u65af\u65b9\u5757 | 55s | ✓ | |||
| C | \u5c0f\u5b66\u9898 | 48s | ✓ | |||
| D | \u65b9\u5757\u6e38\u620f | 30s | ||||
| E | \u6628\u65e5\u65b9\u821f | 41s | ✓ | |||
| F | \u5341\u516d\u8fdb\u5236\u7684\u5f02\u6216 | 1m 13s | ✓ | |||
| G | \u77f3\u5b50\u6e38\u620f | 55s | ✓ | |||
| H | \u5341\u516d\u8fdb\u5236\u7684\u7591\u60d1 | 53s | ✓ | |||
| I | \u7ea0\u7f20\u4e4b\u5706 | 50s | ✓ | |||
| J | \u4e0a\u5b66 | 1m 9s | ✓ | |||
| K | \u73af\u5f62\u6570\u7ec4(easy) | 52s | ✓ | |||
| L | \u73af\u5f62\u6570\u7ec4(hard) | 46s | ✓ | |||
| M | \u8521\u5149\u6570\u7ec4 | 28s |
CF 105160L - 环形数组(hard)
We are given a rectangular grid of size $n times m$ whose cells are filled with the integers from $1$ to $n cdot m$. The filling order is not row-wise or column-wise.
CF 105160M - 蔡光数组
We are given an array of exactly four positive integers, each between 1 and 9. The task is to decide whether this array matches a hidden pattern defined by a string “USST”, where identical characters in the string enforce equality constraints between corresponding positions…
CF 105160J - 上学
We are given a tree with nodes labeled from 1 to n, plus an extra node 0. Node 0 is connected to node 1, so effectively node 0 acts like a root attached above the original tree. Every other edge connects the n student locations into a tree. Each student lives at a unique node i.
CF 105160K - 环形数组(easy)
The task describes a deterministic way to assign numbers to an n by m grid. Imagine starting with an empty matrix and writing integers beginning from 1, increasing one by one, while always walking along the outer boundary of the remaining unfilled region in a clockwise spiral.
CF 105160I - 纠缠之圆
We are given two circles in the plane. Each circle is defined by its center coordinates and radius. For every test case, we need to count how many distinct straight lines exist such that the line is tangent to both circles at the same time.
CF 105160H - 十六进制的疑惑
We are given a collection of hexadecimal numbers written as strings. Each number is supposed to represent a valid non-negative integer in base 16, but the data set has a twist: some entries are correct results of hexadecimal subtraction problems, while others are wrong results…
CF 105160G - 石子游戏
We start with a single pile of stones. Two players alternate turns, Alice moving first. On a turn, if the pile currently has $x$ stones, the player may add between $1$ and $x$ stones inclusive. After the move, the pile size must not exceed a fixed upper bound $k$.
CF 105160F - 十六进制的异或
We are given a collection of distinct numbers written in hexadecimal, and a sequence of queries. For each query, we receive a decimal number $x$.
CF 105160E - 昨日方舟
The grid describes a map where each cell is either blocked or available for placing a unit. Over time, we receive a sequence of placement attempts. Each attempt tries to place a directional unit, a snake, on a specific cell facing up, down, left, or right.
CF 105160D - 方块游戏
We are given an $n times m$ grid that represents a tiled game board. Each cell is either empty or colored with one of three colors labeled 1, 2, and 3.
CF 105160B - 俄罗斯方块
We are given an $n times n$ grid and a multiset of rectangular tiles that can be placed either horizontally or vertically. Every tile is a $1 times k$ strip for some length $k$, and we are allowed to place each strip anywhere inside the grid as long as it stays inside bounds.
CF 105160A - 我是组题人
We are given a list of problem difficulties, where each problem also has an implicit identifier given by its position in the input. The task is to reorder the problem indices according to difficulty from smallest to largest.
CF 105160C - 小学题
We are given a large square $ABCD$ with side length $n$. Inside it sits a smaller square $AEFG$ whose side length is a variable integer $m$, restricted to an interval $[l, r]$.