Codeforces Round 250 (Div. 2)

5 problems from Codeforces Round 250 (Div. 2) (contest 437), difficulty 1300-2500. 5/5 solutions verified against sample I/O.

5 items

Codeforces Round 250 (Div. 2)

Div. 2 | 5 problems | 5/5 verified | Difficulty 1300-2500 | 7m 13s

#	Problem	Rating	Tags	Accepted	Time	✓
A	The Child and Homework	1300	implementation	9,360	1m 7s	✓
B	The Child and Set	1500	bitmasks, greedy, implementation	10,447	1m 29s	✓
C	The Child and Toy	1400	graphs, greedy, sortings	14,992	1m 52s	✓
D	The Child and Zoo	1900	dsu, sortings	3,667	1m 27s	✓
E	The Child and Polygon	2500	dp, geometry	786	1m 18s	✓

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

CF 437C - The Child and Toy

We are given a toy made up of n parts connected by m ropes. Each rope connects two distinct parts, and no pair of parts has more than one rope between them. Each part i has an associated energy cost v[i]. The child removes parts one at a time.

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

CF 437A - The Child and Homework

The task is to simulate how a child chooses an answer on a multiple-choice question with four options, labeled A through D. Each option has a textual description.

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

CF 437D - The Child and Zoo

We are given a connected undirected graph where each node represents a zoo area and carries a value describing how many animals live there. For any ordered pair of distinct areas $p$ and $q$, we look at all simple paths connecting them.

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

CF 437B - The Child and Set

We are asked to reconstruct a set of distinct integers from 1 to a given upper bound, such that the sum of a special function applied to each element equals a target value. The special function, lowbit(x), extracts the lowest set bit of x in its binary representation.

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

CF 437E - The Child and Polygon

We are asked to count how many ways a simple polygon with $n$ vertices can be triangulated. Triangulation here means splitting the polygon into triangles that exactly cover the polygon without overlap and without introducing new points.