Codeforces Round 480 (Div. 2)

4 problems from Codeforces Round 480 (Div. 2) (contest 980), difficulty 900-2900. 3/4 solutions verified against sample I/O.

4 items

Codeforces Round 480 (Div. 2)

Div. 2 | 4 problems | 3/4 verified | Difficulty 900-2900 | 6m 21s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Links and Pearls	900	implementation, math	10,950	1m 7s	✓
B	Marlin	1600	constructive-algorithms	4,923	1m 29s	✓
E	The Number Games	2200	data-structures, greedy, trees	2,117	1m 46s	✓
F	Cactus to Tree	2900	dp, graphs, trees	215	1m 59s

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

CF 980F - Cactus to Tree

We are given a connected undirected graph with a special structure: every vertex can belong to at most one simple cycle. This means the graph looks like a tree where some disjoint cycles have been added, and those cycles never intersect at a vertex.

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

CF 980E - The Number Games

We are given a tree with $n$ nodes. Each node represents a district, and the road system guarantees there is exactly one simple path between any two districts.

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

CF 980B - Marlin

We are given a city shaped like a very small grid: it has exactly 4 rows and an odd number of columns. Two pairs of locations matter: the first journey starts at the top-left corner and wants to reach the bottom-right corner, while the second journey starts at the bottom-left…

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

CF 980A - Links and Pearls

We are given a circular arrangement made of two kinds of characters: pearls represented by o and links represented by -. Because the structure is a necklace, the string is considered cyclic, meaning the last character is adjacent to the first.