Codeforces Round 509 (Div. 2)

3 problems from Codeforces Round 509 (Div. 2) (contest 1041), difficulty 800-1900. 1/3 solutions verified against sample I/O.

3 items

Codeforces Round 509 (Div. 2)

Div. 2 | 3 problems | 1/3 verified | Difficulty 800-1900 | 13m 23s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Heist	800	greedy, implementation, sortings	26,842	2m 41s	✓
C	Coffee Break	1600	binary-search, data-structures, greedy	10,236	4m 36s
E	Tree Reconstruction	1900	constructive-algorithms, data-structures, graphs	3,854	6m 6s

Practice › Codeforces Solutions › Codeforces Round 509 (Div. 2) ›

CF 1041E - Tree Reconstruction

We are given a multiset of information that originally came from a rooted structure, but the structure itself is hidden. There exists a tree on vertices numbered from 1 to n, and each vertex has a unique label equal to its number.

Practice › Codeforces Solutions › Codeforces Round 509 (Div. 2) ›

CF 1041C - Coffee Break

We are given a set of moments inside a working day when Monocarp is willing to drink coffee. Each moment is a specific minute inside a day that lasts from minute 1 to minute m.

Practice › Codeforces Solutions › Codeforces Round 509 (Div. 2) ›

CF 1041A - Heist

We are given a set of keyboard indices that survived a burglary. The key hidden structure is that before the theft, all keyboards formed one continuous block of integers, something like x, x+1, x+2, and so on up to some unknown length.