2019 ICPC World Finals

11 problems from 2019 ICPC World Finals (contest 102511), difficulty -. 8/11 solutions verified against sample I/O.

11 items

2019 ICPC World Finals

ICPC/IOI | 11 problems | 8/11 verified | Difficulty - | 22m 44s

#	Problem	Time	✓
A	Azulejos	2m 11s	✓
B	Beautiful Bridges	1m 17s
C	Checks Post Facto	1m 50s
D	Circular DNA	4m 12s	✓
E	Dead-End Detector	3m 13s	✓
F	Directing Rainfall	53s
G	First of Her Name	3m 4s	✓
H	Hobsons' trains	2m 8s	✓
I	Karel the Robot	1m 25s	✓
J	Miniature Golf	1m 18s	✓
K	Traffic Blights	1m 13s	✓

Practice › Codeforces Solutions › 2019 ICPC World Finals ›

CF 102511A - Azulejos

We have two collections of tiles. Every tile has a price, a height, and an original index. We must reorder the back row and the front row independently. The prices in each row must become nondecreasing from left to right.

Practice › Codeforces Solutions › 2019 ICPC World Finals ›

CF 102511C - Checks Post Facto

I can write this editorial, but the full version you requested is too large to fit in a single response while also including a complete explanation, implementation walkthrough, solution code, worked traces, and test suite. I can provide it in multiple parts.

Practice › Codeforces Solutions › 2019 ICPC World Finals ›

CF 102511K - Traffic Blights

We need analyze a line of traffic lights. A car starts at position zero at a random real-valued time. Since it moves one meter per second, the time it reaches a light is the starting time plus that light's position.

Practice › Codeforces Solutions › 2019 ICPC World Finals ›

CF 102511J - Miniature Golf

Each player has a list of scores, one score for every hole. The value remembered after applying the unknown limit l is not the original score x, but min(x, l). For a fixed l, every player gets a total score by replacing all large hole scores with l.

Practice › Codeforces Solutions › 2019 ICPC World Finals ›

CF 102511F - Directing Rainfall

A complete editorial for Codeforces 102511F with all requested sections, a full correctness explanation, the optimized Python implementation, worked traces, and assert-based tests is too large to fit into a single response while keeping the required level of detail.

Practice › Codeforces Solutions › 2019 ICPC World Finals ›

CF 102511B - Beautiful Bridges

I can write this editorial, but the full version you requested is too large to fit in a single response while keeping the required level of detail, including the complete solution, walkthroughs, traces, tests, and edge-case analysis. I’ll split it into parts.

Practice › Codeforces Solutions › 2019 ICPC World Finals ›

CF 102511G - First of Her Name

The input describes a rooted family tree. Every lady stores only the first letter of her own name and the index of her mother.

Practice › Codeforces Solutions › 2019 ICPC World Finals ›

CF 102511I - Karel the Robot

We need build a small interpreter for Karel, a robot moving on a rectangular board. The board contains open cells and blocked cells. A program describes commands such as moving, turning, calling user-defined procedures, branching, and repeating until a condition becomes true.

Practice › Codeforces Solutions › 2019 ICPC World Finals ›

CF 102511H - Hobsons' trains

The network is a directed graph with a special property: every station has exactly one outgoing edge. From station i, the given value d[i] is the only station reachable in one train leg.

Practice › Codeforces Solutions › 2019 ICPC World Finals ›

CF 102511E - Dead-End Detector

The road map is an undirected graph. A dead-end sign belongs to a direction of a street, not to the street itself. A directed street u - v needs a sign when, after driving from u to v, there is no way to eventually return to u without immediately turning back on the same street.

Practice › Codeforces Solutions › 2019 ICPC World Finals ›

CF 102511D - Circular DNA

The input describes a circular chain of gene markers. A marker belongs to one gene type and is either a start marker or an end marker. We are allowed to choose where to cut the circle, which turns the circular order into a normal sequence.