Codeforces Round 199 (Div. 2)

5 problems from Codeforces Round 199 (Div. 2) (contest 342), difficulty 1200-2400. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 199 (Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 1200-2400 | 8m 19s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Xenia and Divisors	1200	greedy, implementation	13,870	1m 36s	✓
B	Xenia and Spies	1500	brute-force, greedy, implementation	4,207	1m 32s	✓
C	Cupboard and Balloons	1900	geometry	1,995	1m 38s	✓
D	Xenia and Dominoes	2100	bitmasks, dfs-and-similar, dp	567	2m 11s
E	Xenia and Tree	2400	data-structures, divide-and-conquer, trees	10,830	1m 22s	✓

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

CF 342C - Cupboard and Balloons

The task is to determine how many spherical balloons of radius 1 can fit inside a cupboard shaped like a semicircle on top of a rectangle. The cupboard has a semicircular top with radius r and vertical walls of height h, forming a depth also equal to r.

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

CF 342B - Xenia and Spies

A note starts at one spy positioned at index s in a line of n spies. The note must eventually reach another spy at position f.

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

CF 342E - Xenia and Tree

We are working with a tree where every node represents a point in a connected acyclic graph. Initially only node 1 is colored red, while every other node starts blue. Over time, we perform two kinds of operations.

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

CF 342D - Xenia and Dominoes

We are given a 3×n grid representing a puzzle board. Each cell can be forbidden, free, or marked with a special circle. Dominoes, which are 1×2 or 2×1 tiles, must be placed to cover exactly two non-forbidden cells.

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, and the length of the sequence is divisible by three.