Codeforces Round 612 (Div. 1)

5 problems from Codeforces Round 612 (Div. 1) (contest 1286), difficulty 1800-3200. 1/5 solutions verified against sample I/O.

5 items

Codeforces Round 612 (Div. 1)

Div. 1 | 5 problems | 1/5 verified | Difficulty 1800-3200 | 20m 52s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Garland	1800	dp, greedy, sortings	9,643	2m 42s	✓
B	Numbers on Tree	1800	constructive-algorithms, data-structures, dfs-and-similar	5,467	5m 21s
C1	Madhouse (Easy version)	2400	brute-force, constructive-algorithms, interactive	1,579	4m 5s
C2	Madhouse (Hard version)	2800	brute-force, constructive-algorithms, hashing	745	6m 2s
E	Fedya the Potter Strikes Back	3200	data-structures, strings	665	2m 42s

Practice › Codeforces Solutions › Codeforces Round 612 (Div. 1) ›

CF 1286C2 - Madhouse (Hard version)

A hidden string of length $n$ is fixed before the game starts. The player’s goal is to recover this exact string. Instead of being given it directly, the only way to gain information is by querying substrings of ranges.

Practice › Codeforces Solutions › Codeforces Round 612 (Div. 1) ›

CF 1286B - Numbers on Tree

We are given a rooted tree where every node has a hidden integer value. What we do know is the tree structure and, for each node, a number ci.

Practice › Codeforces Solutions › Codeforces Round 612 (Div. 1) ›

CF 1286C1 - Madhouse (Easy version)

We are dealing with a hidden string of length $n$, made of lowercase English letters. We cannot see the string directly. Instead, we can query any segment $s[l..

Practice › Codeforces Solutions › Codeforces Round 612 (Div. 1) ›

CF 1286E - Fedya the Potter Strikes Back

We are asked to maintain a string S and an integer array W dynamically as queries arrive. Each query adds a new character to S and a weight to W.

Practice › Codeforces Solutions › Codeforces Round 612 (Div. 1) ›

CF 1286A - Garland

We are given a row of n bulbs, each numbered from 1 to n. Some bulbs are missing, indicated by zeros in the input array.