2022-2023 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2022)
11 problems from 2022-2023 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2022) (contest 104030), difficulty -. 9/11 solutions verified against sample I/O.
2022-2023 ACM-ICPC Nordic Collegiate Programming Contest (NCPC 2022)
ICPC/IOI | 11 problems | 9/11 verified | Difficulty - | 11m 25s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Ace Arbiter | 48s | ✓ | |||
| B | Berry Battle | 2m 3s | ||||
| C | Coffee Cup Combo | 46s | ✓ | |||
| D | Disc District | 47s | ✓ | |||
| E | Enigmatic Enumeration | 1m 11s | ✓ | |||
| F | Foreign Football | 42s | ✓ | |||
| G | Graduation Guarantee | 2m 5s | ||||
| H | Highest Hill | 44s | ✓ | |||
| I | Icy Itinerary | 46s | ✓ | |||
| J | Junk Journey | 46s | ✓ | |||
| K | Keyboard Queries | 47s | ✓ |
CF 104030K - Keyboard Queries
We are given a hidden string indexed from 1 to n. We never see the characters directly. Instead, we receive two kinds of information about it. The first type of query tells us that a certain substring is guaranteed to read the same forward and backward.
CF 104030G - Graduation Guarantee
Let the ZDD represent a family $mathcal{F}$ of subsets of ${x1,dots,xn}$, ordered by the variable indices, and let each node $k$ be labeled by $V(k)in{1,dots,n}$.
CF 104030J - Junk Journey
The problem gives us an infinite grid with a small number of special cells: a starting position for a robot, a target cell called the depot, and up to 50 scooters placed at distinct grid coordinates. The robot moves one step at a time in the four cardinal directions.
CF 104030H - Highest Hill
We are given a long sequence of terrain heights sampled at evenly spaced positions. From this sequence, we want to identify a special kind of “peak” defined by choosing three indices i, j, k with i < j < k such that the height first does not decrease up to j and then does…
CF 104030I - Icy Itinerary
We are given a town modeled as an undirected graph on n houses. Some pairs of houses are connected by roads, and every other pair is considered connected only by an implicit “non-road” relation, meaning Thomas must travel between them using skis.
CF 104030E - Enigmatic Enumeration
We are given an undirected simple graph. The task is not to find just one cycle, but to determine how many cycles achieve the minimum possible length among all cycles in the graph.
CF 104030F - Foreign Football
We are given a hidden set of $n$ strings, one per football team, and every pair of distinct teams produces a recorded match string that is simply the concatenation of the two team names in order.
CF 104030B - Berry Battle
Let the ZDD represent a family $mathcal{F}$ of subsets of ${x1,dots,xn}$, ordered by the variable indices, and let each node $k$ be labeled by $V(k)in{1,dots,n}$.
CF 104030D - Disc District
We are given a circle centered at the origin in the plane, with radius $r$. Every point whose distance from the origin is strictly greater than $r$ is considered outside the circle.
CF 104030A - Ace Arbiter
We are given a chronological log of score snapshots from a ping pong game between two players. The game ends as soon as one player reaches 11 points, and no further points should exist beyond that moment.
CF 104030C - Coffee Cup Combo
We are given a sequence of n lectures arranged in order. Each lecture either has a coffee machine or does not. The student starts before the first lecture with no coffee cups, and during each lecture she must consume exactly one cup in order to stay awake.