Codeforces Round 249 (Div. 2)

5 problems from Codeforces Round 249 (Div. 2) (contest 435), difficulty 1000-2500. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 249 (Div. 2)

Div. 2 | 5 problems | 2/5 verified | Difficulty 1000-2500 | 11m 19s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Queue on Bus Stop	1000	implementation	11,084	1m 7s	✓
B	Pasha Maximizes	1400	greedy	7,560	4m 8s	✓
C	Cardiogram	1600	implementation	2,724	2m 18s
D	Special Grid	2000	brute-force, dp, greedy	788	1m 26s
E	Special Graph	2500		259	2m 20s

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

CF 435D - Special Grid

We are given a rectangular grid with n rows and m columns. Each intersection of horizontal and vertical lines - each "node" - is colored either black or white. Additionally, every unit square in the grid has diagonals drawn.

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

CF 435E - Special Graph

We have an $n times m$ grid of vertices. Two vertices are connected if they share a side, and also if they are opposite corners of the same unit square. In other words, every cell contributes all four edges of the square plus both diagonals.

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

CF 435B - Pasha Maximizes

We are given a positive integer, which we can treat as a string of decimal digits, and a maximum number of allowed adjacent swaps, k. The goal is to transform this number into the largest possible number by rearranging digits, but each move can only swap two neighboring digits.

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

CF 435C - Cardiogram

The input describes a polyline that alternates between rising and falling diagonal segments. The length of the $i$-th segment is $ai$.

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

CF 435A - Queue on Bus Stop

We have a line of people waiting at a bus stop, but they are organized into groups. Each group has a fixed number of people and stands consecutively in the queue. A bus comes that can carry at most m people, and the people enter in the order of their groups.