Codeforces Round 609 (Div. 1)

3 problems from Codeforces Round 609 (Div. 1) (contest 1268), difficulty 2000-3400. 1/3 solutions verified against sample I/O.

3 items

Codeforces Round 609 (Div. 1)

Div. 1 | 3 problems | 1/3 verified | Difficulty 2000-3400 | 10m 38s

#	Problem	Rating	Tags	Accepted	Time	✓
B	Domino for Young	2000	dp, greedy, math	6,430	2m 12s	✓
C	K Integers	2300	binary-search, data-structures	1,953	3m 43s
E	Happy Cactus	3400	dp	295	4m 43s

Practice › Codeforces Solutions › Codeforces Round 609 (Div. 1) ›

CF 1268E - Happy Cactus

We are given a connected undirected graph where each edge has a unique label from 1 to m. The structure is special: every edge belongs to at most one simple cycle, which means the graph is a cactus. This guarantees that cycles do not overlap except possibly at single vertices.

Practice › Codeforces Solutions › Codeforces Round 609 (Div. 1) ›

CF 1268C - K Integers

We are given a permutation of the numbers from 1 to n. The goal is to understand how expensive it is, in terms of adjacent swaps, to force the numbers 1 through k to appear as a contiguous block in increasing order somewhere inside the array.

Practice › Codeforces Solutions › Codeforces Round 609 (Div. 1) ›

CF 1268B - Domino for Young

The Young diagram can be viewed as a histogram whose column heights are given by a non-increasing array $a1,a2,dots,an$.