The 2021 Zhejiang University City College Freshman Programming Contest
12 problems from The 2021 Zhejiang University City College Freshman Programming Contest (contest 103488), difficulty -. 11/12 solutions verified against sample I/O.
The 2021 Zhejiang University City College Freshman Programming Contest
Special | 12 problems | 11/12 verified | Difficulty - | 11m 4s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | All in! | 41s | ✓ | |||
| B | Boboge and Tall Building | 45s | ✓ | |||
| C | Constructive Problem | 47s | ✓ | |||
| D | Diseased String | 2m 23s | ||||
| E | Equality | 50s | ✓ | |||
| F | Future Vision | 51s | ✓ | |||
| G | Generate 7 Colors | 47s | ✓ | |||
| H | Hile and Subsequences' MEX | 44s | ✓ | |||
| I | If I Catch You | 46s | ✓ | |||
| J | Jiubei and Codeforces | 49s | ✓ | |||
| K | Klee and Bomb | 55s | ✓ | |||
| L | Lexicographic Order | 46s | ✓ |
CF 103488D - Diseased String
Let $q$ be a primitive $m$th root of unity and let $$N = n1 + cdots + nt.$$ Write each index in base $m$ form $$ni = m ai + ri,qquad 0 le ri < m,$$ and define $$A = a1 + cdots + at,qquad R = r1 + cdots + rt,$$ so that $N = mA + R$.
CF 103488F - Future Vision
We are given a grid maze where some cells are walls and others are empty. A character starts from a fixed cell marked H at time zero and can move each minute to any of the four adjacent cells or stay in place. Movement is blocked by walls.
CF 103488E - Equality
We are given an array and a fixed window size. In one move, we choose a contiguous segment of exactly length k and overwrite every element in that segment with the minimum value currently inside that segment.
CF 103488K - Klee and Bomb
We are given a graph where each node represents a bomb and each bomb has a color. Edges represent connections between bombs.
CF 103488L - Lexicographic Order
We are given a reference string s of length n, and an upper bound m on the length of another string t that we are allowed to construct.
CF 103488J - Jiubei and Codeforces
We are simulating how a Codeforces rating evolves over time and how that rating translates into a visible title. Each user starts with an initial rating, then goes through a sequence of rating changes caused by contests.
CF 103488I - If I Catch You
We are dealing with a game played on the perimeter of an $n times n$ grid, which forms a cycle of $4n - 4$ cells. Two players, Liola and Eastred, move only clockwise along this cycle. Liola starts at the top-right corner, and Eastred starts at the bottom-left corner.
CF 103488H - Hile and Subsequences' MEX
We are given a very large increasing sequence that always looks like a permutation prefix, specifically the array contains all integers from 0 to n-1 in order.
CF 103488G - Generate 7 Colors
We are given seven target quantities, one for each color from 0 to 6. The goal is to produce exactly those many pieces of each color using a limited operation.
CF 103488C - Constructive Problem
We are asked to construct an array of length n with a very specific self-referential property. The value at position i is not arbitrary; instead, it must equal the number of occurrences of the value i inside the array itself.
CF 103488B - Boboge and Tall Building
The building is modeled as a vertical structure split into a fixed number of equal-height floors. The total height of the building is given as a single value, and that height is distributed uniformly across all floors.
CF 103488A - All in!
The task is intentionally minimal once you strip away the storytelling. There is no input at all, not even hidden parameters or multiple test cases. The program is required to print a single fixed string exactly as specified.