2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)
Solutions for 2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) (contest 1510). 5/11 problems verified against sample I/O. Difficulty range: 1200-3200.
2020-2021 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred)
Type: ICPC/IOI | Problems: 11 | Verified: 5/11 | Rating range: 1200-3200 | Time: 49m 4s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| A | ASCII Automata Art | 3100 | - | 1m 16s | ✗ |
| B | Button Lock | 2600 | flows, graph-matchings, graphs | 3m 7s | ✓ |
| C | Cactus Not Enough | 2900 | dfs-and-similar, graph-matchings, graphs | 3m 19s | ✗ |
| D | Digits | 2100 | dp, math, number-theory | 23m 14s | ✗ |
| E | Equilibrium Point /\textbackslash/\textbackslash | 2700 | - | 1m 57s | ✓ |
| F | Fiber Shape | 2800 | - | 3m 6s | ✗ |
| G | Guide | 2100 | - | 2m 4s | ✓ |
| H | Hard Optimization | 3200 | dp | 3m 6s | ✗ |
| I | Is It Rated? | 2700 | greedy, interactive, math | 3m 29s | ✗ |
| J | Japanese Game | 2700 | constructive-algorithms, math | 1m 52s | ✓ |
| K | King's Task | 1200 | brute-force, graphs, implementation | 2m 34s | ✓ |
CF 1510D - Digits
We have n cards. Each card contains a positive integer. We may choose any non-empty subset of cards and multiply all chosen numbers. The goal is not merely to obtain a product whose last decimal digit equals d.
CF 1510K - King's Task
We are given a permutation of integers from 1 to 2n, and we are allowed two special operations to rearrange it. The first operation swaps every consecutive pair in the sequence: positions 1 and 2, 3 and 4, and so on.
CF 1510J - Japanese Game
We are given a game with a row of tiles, each tile labeled with a positive integer. Two players, let us call them Takahashi and Aoki, play alternately.
CF 1510I - Is It Rated?
In this problem, you act as a participant, Izzy, in a series of wagers predicting whether improv contests will be rated or unrated. For each wager, you see the predictions of all other participants, then make your own prediction. After that, the real outcome is revealed.
CF 1510H - Hard Optimization
We are asked to select a subsegment from each of a set of laminar segments on the integer line in order to maximize the total length. Each input segment is defined by its left and right endpoints, and all endpoints are distinct.
CF 1510G - Guide
The problem gives us a directed graph where each node has a label, and each label represents a "guide" value. Each node can direct us to one of its outgoing neighbors, and the task is to determine, for each node, whether following the sequence of guides will eventually reach a…
CF 1510F - Fiber Shape
We are asked to compute the area enclosed by a string stretched around a set of pins positioned at the vertices of a convex polygon, and then allowed to expand slightly while keeping the total perimeter bounded.
CF 1510E - Equilibrium Point /\textbackslash/\textbackslash
We are given a sequence of integers representing a row of weights, and we want to find a position along this row that balances the sequence according to a certain rule.
CF 1510C - Cactus Not Enough
The problem gives us a cactus graph, which is a connected undirected graph where each edge belongs to at most one simple cycle. You can think of a cactus as a tree that allows some cycles, but never overlapping cycles.
CF 1510B - Button Lock
The problem gives us a push-button combination lock with d buttons labeled from 0 to d-1. Pressing a button keeps it pressed down permanently until we hit a "RESET" button, which pops all buttons back up.