Codeforces Round 530 (Div. 2)

4 problems from Codeforces Round 530 (Div. 2) (contest 1099), difficulty 800-2400. 2/4 solutions verified against sample I/O.

4 items

Codeforces Round 530 (Div. 2)

Div. 2 | 4 problems | 2/4 verified | Difficulty 800-2400 | 24m 24s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Snowball	800	implementation	13,348	6m 22s	✓
B	Squares and Segments	1100	binary-search, constructive-algorithms, math	11,476	1m 10s	✓
C	Postcard	1200	constructive-algorithms, implementation	10,420	10m 9s
F	Cookies	2400	binary-search, data-structures, dfs-and-similar	1,036	6m 43s

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

CF 1099C - Postcard

We are given a string that mixes plain lowercase letters with two special symbols that always appear immediately after a letter. One symbol behaves like a weak modifier that allows the preceding letter to be either kept or deleted.

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

CF 1099A - Snowball

The process describes a snowball sliding downward from a starting height until it reaches the ground. At every integer height level, the snowball repeatedly changes its weight in three ordered phases: it first gains additional weight equal to its current height, then possibly…

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

CF 1099F - Cookies

We are given a rooted tree where each vertex contains a pile of cookies. Every vertex also has a cost for eating one cookie at that vertex, and every edge from a node to its parent has a cost for moving upward along it. A chip starts at the root.

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

CF 1099B - Squares and Segments

We are asked to think about building a figure composed of unit squares drawn on a grid, where every square is outlined by horizontal and vertical unit segments. Each segment can be either horizontal or vertical, and every segment has length exactly one.