Codeforces Round 609 (Div. 1)

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

5 items

Codeforces Round 609 (Div. 1)

Div. 1 | 5 problems | 4/5 verified | Difficulty 1700-3400 | 16m 7s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Long Beautiful Integer	1700	constructive-algorithms, greedy, implementation	9,069	4m 36s	✓
B	Domino for Young	2000	dp, greedy, math	6,430	2m 12s	✓
C	K Integers	2300	binary-search, data-structures	1,953	3m 43s
D	D	3200	brute force, divide and conquer, graphs	639	3m 22s	✓
E	Happy Cactus	3400	dp	295	2m 14s	✓

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

CF 1268A - Long Beautiful Integer

We are given a decimal string representing a positive integer with $n$ digits. Along with it, there is a fixed step size $k$.

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

CF 1268E - Happy Cactus

We are given a connected undirected cactus graph where every edge has a unique label from 1 to m. These labels define a strict global ordering of edges.

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

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$.

Codeforces Round 609 (Div. 1)

Codeforces Round 609 (Div. 1)

CF 1268A - Long Beautiful Integer

CF 1268E - Happy Cactus

CF 1268C - K Integers

CF 1268B - Domino for Young