2021-2022 ICPC Northwestern European Regional Programming Contest (NWERC 2021)
12 problems from 2021-2022 ICPC Northwestern European Regional Programming Contest (NWERC 2021) (contest 104064), difficulty -. 10/12 solutions verified against sample I/O.
2021-2022 ICPC Northwestern European Regional Programming Contest (NWERC 2021)
ICPC/IOI | 12 problems | 10/12 verified | Difficulty - | 13m 31s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Access Denied | 47s | ✓ | |||
| B | Boredom Buster | 2m 8s | ||||
| C | Cutting Edge | 1m 19s | ✓ | |||
| D | Dyson Circle | 58s | ✓ | |||
| E | Exchange Students | 50s | ✓ | |||
| F | Flatland Olympics | 51s | ✓ | |||
| G | Glossary Arrangement | 49s | ✓ | |||
| H | Heating Up | 2m 10s | ||||
| I | IXth Problem | 1m 1s | ✓ | |||
| J | Jet Set | 46s | ✓ | |||
| K | Knitpicking | 45s | ✓ | |||
| L | Lucky Shirt | 1m 7s | ✓ |
CF 104064L - Lucky Shirt
We are tracking a single distinguished T-shirt inside a stack of $n$ shirts. The stack is always accessed from the top: every morning you wear the top shirt, and it goes into a laundry basket at the end of the day. At night, you occasionally do laundry.
CF 104064K - Knitpicking
We are given a collection of socks split into several groups. Each group describes socks of the same type, where a type is defined by a name and a fit category. The fit can be left, right, or any.
CF 104064H - Heating Up
We work in the family algebra of Exercise 203. A family is a set of sets of positive integers, and all operations are defined elementwise at the level of these sets.
CF 104064I - IXth Problem
We are given a multiset of Roman numeral tiles. Each tile is one of the seven symbols used in Roman numerals: M, D, C, L, X, V, and I. The input tells us how many copies of each symbol we have.
CF 104064J - Jet Set
We are given a sequence of points on the Earth described by latitude and longitude. A traveller starts at the first point, moves through the points in order, and finally returns from the last point back to the first using the same rule: each leg of the journey follows the…
CF 104064G - Glossary Arrangement
We are given a list of filenames already sorted in lexicographic order and a maximum terminal width. We must print these names in a column layout similar to the Unix ls command, but with one key difference: we are allowed to choose different column heights per column, instead…
CF 104064F - Flatland Olympics
We are given a straight running track represented by a line segment from point $s$ to point $e$ in the plane, and a set of spectator seats, each at some distinct coordinate not lying on the segment.
CF 104064E - Exchange Students
We are given an initial lineup of students, each represented by a height, and a target lineup that contains exactly the same multiset of heights but in a different order.
CF 104064B - Boredom Buster
We work in the family algebra of Exercise 203. A family is a set of sets of positive integers, and all operations are defined elementwise at the level of these sets.
CF 104064D - Dyson Circle
We are given a large set of points on an integer grid. Each point represents a “star”, and we need to surround all of them using unit squares placed on the same grid. We are allowed to choose some grid cells and mark them as “Dyson units”.
CF 104064C - Cutting Edge
We are given a rectangular block in 3D with integer side lengths $a times b times c$. From this block, we must choose up to 100 integer lattice points inside it.
CF 104064A - Access Denied
The system hides a secret password of length between 1 and 20, composed of digits and English letters. We are allowed to repeatedly submit candidate strings. After each submission, the interactor tells us whether the guess is correct.