2018-2019 ICPC Southwestern European Regional Programming Contest (SWERC 2018)
11 problems from 2018-2019 ICPC Southwestern European Regional Programming Contest (SWERC 2018) (contest 102465), difficulty -. 11/11 solutions verified against sample I/O.
2018-2019 ICPC Southwestern European Regional Programming Contest (SWERC 2018)
ICPC/IOI | 11 problems | 11/11 verified | Difficulty - | 54m 1s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | City of Lights | 6m 1s | ✓ | |||
| B | Blurred Pictures | 4m 17s | ✓ | |||
| C | Crosswords | 9m 32s | ✓ | |||
| D | Monument Tour | 6m 13s | ✓ | |||
| E | Rounding | 3m 41s | ✓ | |||
| F | Paris by Night | 2m 46s | ✓ | |||
| G | Strings | 3m 9s | ✓ | |||
| H | Travel Guide | 2m 21s | ✓ | |||
| I | Mason's Mark | 4m 19s | ✓ | |||
| J | Mona Lisa | 7m 19s | ✓ | |||
| K | Dishonest Driver | 4m 23s | ✓ |
CF 102465C - Crosswords
We need to construct an N × M character grid. Every row must be one of the B horizontal words, each of length M, and every column must be one of the A vertical words, each of length N. A word may be reused any number of times.
CF 102465E - Rounding
We have P places, and exactly 10,000 people each chose one place. If a place was chosen by c people, its true percentage is [ frac{c}{100}% ] because 10,000 people make every percentage step exactly 0.01. The agency did not report these exact percentages.
CF 102465F - Paris by Night
We have (N) monuments. Monument (i) has coordinates ((xi,yi)) and a positive grade (gi). Morgane chooses two distinct monuments as the endpoints of a line.
CF 102465A - City of Lights
We have N lights numbered from 1 through N. Initially every light is on. Each of the k commands contains a positive integer x, and that command toggles every light whose number is a multiple of x. A toggled light changes from on to off or from off to on.
CF 102465J - Mona Lisa
We have four independent instances of the same 64-bit pseudorandom generator, one for each keypad. A secret code is simply a positive index into one generator sequence.
CF 102465K - Dishonest Driver
We have a string describing the sequence of locations visited during the trip. A compressed description can represent one character directly, concatenate two already compressed descriptions, or take one compressed description and repeat it any positive number of times.
CF 102465I - Mason's Mark
We have a black and white pixel grid representing several stones. The black pixels have three possible roles. Some belong to the connected black region outside all stones, some form the actual mason's mark inside a stone, and some are isolated noise pixels.
CF 102465H - Travel Guide
Every station can be represented by three numbers. For a station (v), let [ D(v) = (d0(v), d1(v), d2(v)), ] where (d0(v)) is its shortest distance to Orly, (d1(v)) is its shortest distance to Notre-Dame, and (d2(v)) is its shortest distance to Disneyland.
CF 102465G - Strings
We have one initial string, S(0), whose length is at most 1000. Every later string is defined from strings that already exist. An APP x y operation creates S(x) + S(y), while a SUB x lo hi operation creates the half-open substring S(x)[lo:hi].
CF 102465D - Monument Tour
The city is a rectangular grid. The bus chooses one horizontal eastbound road, represented by a fixed row coordinate y = r, enters from the west, travels all the way east, and must leave on that same row.
CF 102465B - Blurred Pictures
Each row of the picture contains one contiguous interval of good pixels. For row (i), the good pixels occupy columns from (ai) through (bi), inclusive. We need the largest axis-aligned square whose every pixel is good. Suppose a square uses rows (l) through (r).