Codeforces Round 199 (Div. 2)

Solutions for Codeforces Round 199 (Div. 2) (contest 342). 2/3 problems verified against sample I/O. Difficulty range: 1200-2400.

3 items

Codeforces Round 199 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 2/3 | Rating range: 1200-2400 | Time: 16m 31s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Xenia and Divisors	1200	greedy, implementation	6m 2s	✗
C	Cupboard and Balloons	1900	geometry	5m 17s	✓
E	Xenia and Tree	2400	data-structures, divide-and-conquer, trees	5m 12s	✓

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

CF 342A - Xenia and Divisors

We are given a sequence of positive integers, all between 1 and 7, whose length is divisible by three. The task is to split this sequence into triplets so that within each triplet the numbers are strictly increasing and each number divides the next.

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

CF 342C - Cupboard and Balloons

Xenia has a cupboard shaped like a semicircular arch on top of two vertical walls. The semicircle has radius r and the walls have height h, with the cupboard’s depth also equal to r. Inside, she wants to store spherical balloons of radius 1.

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

CF 342E - Xenia and Tree

We are given a tree of n nodes, rooted conceptually at node 1, which starts painted red. All other nodes are blue. We have to handle two types of queries: first, paint a blue node red; second, for a given node, report the distance to the nearest red node.