2019-2020 ICPC Northwestern European Regional Programming Contest (NWERC 2019)
11 problems from 2019-2020 ICPC Northwestern European Regional Programming Contest (NWERC 2019) (contest 102500), difficulty -. 9/11 solutions verified against sample I/O.
2019-2020 ICPC Northwestern European Regional Programming Contest (NWERC 2019)
ICPC/IOI | 11 problems | 9/11 verified | Difficulty - | 21m 58s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Average Rank | 2m 7s | ||||
| B | Balanced Cut | 1m 27s | ||||
| C | Canvas Line | 3m 7s | ✓ | |||
| D | Disposable Switches | 1m 28s | ✓ | |||
| E | Expeditious Cubing | 1m 1s | ✓ | |||
| F | Firetrucks Are Red | 53s | ✓ | |||
| G | Gnoll Hypothesis | 3m 47s | ✓ | |||
| H | Height Profile | 1m 18s | ✓ | |||
| I | Inverted Deck | 2m 43s | ✓ | |||
| J | Jackdaws And Crows | 3m 9s | ✓ | |||
| K | Kitesurfing | 58s | ✓ |
CF 102500C - Canvas Line
We have a sequence of non-overlapping canvases on a number line. Each canvas covers an interval from its left endpoint to its right endpoint, and a peg located exactly at an endpoint counts as touching that canvas. Some pegs already exist.
CF 102500B - Balanced Cut
I can provide the complete editorial, but it is too large to fit reliably in a single response with all requested sections, the full proof, the Python implementation, worked traces, and test suite. I will split it into parts. The next response will contain: 1.
CF 102500A - Average Rank
I can write this editorial, but the complete version requested is too large to fit in a single response while preserving the required sections, explanation depth, code, traces, and tests. I’ll provide it in parts so the full editorial remains readable and complete.
CF 102500I - Inverted Deck
We have a sequence of card rarity values. The sequence should be sorted in non-decreasing order, but one continuous segment may have been reversed. The task is to find the segment that, when reversed once, makes the whole sequence sorted.
CF 102500H - Height Profile
I will provide the editorial as a reusable document. Edit The race profile is described by the heights of the road at every integer kilometre. Between two consecutive kilometre marks, the road is a straight line, so the slope is constant inside every segment.
CF 102500K - Kitesurfing
The race is a one-dimensional path from position 0 to position s. Some parts of this path are occupied by islands, represented by non-overlapping intervals. Nora must stay on the line, so she cannot move through an island.
CF 102500J - Jackdaws And Crows
We have a sequence of comment scores. Nick is allowed to spend time creating fake accounts, where each account can change any chosen score by one in either direction, and he can also remove comments.
CF 102500G - Gnoll Hypothesis
We have a circular list of n monster types. Before the update, type i appears with probability s[i] percent. A spawn location now keeps only k randomly chosen types.
CF 102500F - Firetrucks Are Red
We have n people. Each person is described by a set of numbers. Two people can be directly connected if there exists a number that appears in both of their descriptions.
CF 102500E - Expeditious Cubing
Claire has four completed solve times and one final solve left. Her final score is calculated by taking all five times, removing the fastest solve and the slowest solve, then averaging the three remaining times.
CF 102500D - Disposable Switches
We have an undirected network where every cable has a known length, but the actual transmission time of a cable depends on two unknown global parameters. For a cable of length l, its time is l / v + c, where the same v and c apply to every cable.