Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals)
7 problems from Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 — Finals) (contest 2215), difficulty 1700-3500. 0/7 solutions verified against sample I/O.
Codeforces Round 1092 (Unrated, Div. 1, Based on THUPC 2026 \u2014 Finals)
Div. 1 | 7 problems | 0/7 verified | Difficulty 1700-3500 | 12m 54s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Interval Mod | 1700 | constructive-algorithms, dp, greedy | 2,422 | 1m 59s | |
| B | RReeppeettiittiioonn | 2000 | binary-search, brute-force, implementation | 982 | 2m 5s | |
| C | Oriented Journey | 2200 | bitmasks, brute-force, communication | 612 | 1m 54s | |
| D | EXPloration, EXPloitation, and Gain Some EXPerience! | 2800 | bitmasks, brute-force, dp | 111 | 1m 44s | |
| E | Star Map | 2700 | constructive-algorithms, data-structures, geometry | 160 | 1m 38s | |
| F | Research | 3500 | games | 44 | 1m 40s | |
| G | Maze | 3500 | trees | 50 | 1m 54s |
CF 2215G - Maze
We are given a maze represented by a grid of size $(n+2) times (n+2)$, where the outermost cells are automatically obstacles. Additional obstacle cells are provided, and it is guaranteed that all obstacles form a 4-connected component.
CF 2215F - Research
We are looking at a two-player deterministic game played on a deck that is mostly identical cards except for one special card. The special card, initially green, sits at a known position from the top.
CF 2215D - EXPloration, EXPloitation, and Gain Some EXPerience!
We are given a line of positions from 1 to $n$. Two tokens start at positions 1 and 2, and these two starting positions are already considered “taken” from the very beginning. Each token belongs to one player: Shiro controls position 1 and White controls position 2.
CF 2215E - Star Map
We are given a set of points in the plane. A key structural guarantee is that no two points share the same x-coordinate and no two share the same y-coordinate, so every point is uniquely identifiable by its horizontal and vertical rank.
CF 2215B - RReeppeettiittiioonn
The problem asks us to count the number of ways a given positive integer $n$ can be represented in a "repetitive" form across all numeral bases.
CF 2215A - Interval Mod
We are given an array of integers and two moduli, $p$ and $q$, along with a minimum interval length $k$. The allowed operation is to choose any contiguous subarray of length at least $k$ and reduce every element in that subarray modulo either $p$ or $q$.
CF 2215C - Oriented Journey
We are dealing with a two-phase communication system built around a tree. First, an agent receives an undirected tree one edge at a time and must immediately orient each edge.