2018-2019 ICPC Northwestern European Regional Programming Contest (NWERC 2018)
11 problems from 2018-2019 ICPC Northwestern European Regional Programming Contest (NWERC 2018) (contest 102483), difficulty -. 10/11 solutions verified against sample I/O.
2018-2019 ICPC Northwestern European Regional Programming Contest (NWERC 2018)
ICPC/IOI | 11 problems | 10/11 verified | Difficulty - | 29m 37s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Access Points | 2m 13s | ✓ | |||
| B | Brexit Negotiations | 1m 43s | ✓ | |||
| C | Circuit Board Design | 2m 15s | ✓ | |||
| D | Date Pickup | 2m 3s | ||||
| E | Equality Control | 1m 49s | ✓ | |||
| F | Fastest Speedrun | 3m 10s | ✓ | |||
| G | Game Design | 3m 51s | ✓ | |||
| H | Hard Drive | 3m 37s | ✓ | |||
| I | Inflation | 3m 19s | ✓ | |||
| J | Jinxed Betting | 3m 31s | ✓ | |||
| K | Kleptography | 2m 6s | ✓ |
CF 102483B - Brexit Negotiations
We have a directed acyclic graph of negotiation topics. Each topic has a base discussion time e[i], and some topics can only be discussed after certain other topics are finished. A valid schedule is any topological ordering of this graph.
CF 102483D - Date Pickup
I can write the full editorial, but the requested format is too large to fit cleanly into a single response here. It includes a long explanation, a complete Python solution, walkthroughs, test harnesses, and edge-case analysis, which would exceed the available response length.
CF 102483H - Hard Drive
We need build a binary string representing the hard drive. The string has length n, some positions are unusable and must contain 0, and position n is always one of those unusable positions. The first position is always writable.
CF 102483F - Fastest Speedrun
We have a game with n levels. Finishing level i permanently gives us item i. At any moment, the only item that matters for normal gameplay is the largest numbered item we have collected, because every larger item is never worse than a smaller one.
CF 102483E - Equality Control
We are given two programs written in a small language where every expression produces a list of positive integers. The programs may contain fixed lists, concatenation, random shuffling, and sorting.
CF 102483A - Access Points
We have n teams. Team i has a fixed access point at coordinates (si, ti), and we must choose a final location (xi, yi) for that team.
CF 102483I - Inflation
There are balloons with capacities 1, 2, ..., n and gas canisters containing integer amounts of helium. Each canister must be assigned to exactly one balloon, and the amount of helium in a canister cannot be split. A balloon cannot receive more helium than its capacity.
CF 102483K - Kleptography
The task is to recover the original diary text from an encrypted string. The cipher uses an autokey mechanism: the first n characters of the key are unknown, but after that point the key repeats characters from the beginning of the plaintext.
CF 102483J - Jinxed Betting
Julia is one bettor among many. Her current score is at least as large as everyone else’s. After every future match, she copies the majority prediction of the bettors who currently have the highest score among the opponents.
CF 102483G - Game Design
The task is to build a maze that forces a ball to follow a given sequence of tilts and finally fall into the central hole. We are not given the maze, only the moves Carol wants to perform. We must choose the initial ball position and the coordinates of wooden blocks.
CF 102483C - Circuit Board Design
The input describes an electrical circuit as a tree. Each vertex is a connection point and each edge is a wire that must be drawn as a straight segment.