Codeforces Round 186 (Div. 2)

5 problems from Codeforces Round 186 (Div. 2) (contest 313), difficulty 900-2300. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 186 (Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 900-2300 | 6m 20s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Ilya and Bank Account	900	implementation, number-theory	65,004	56s	✓
B	Ilya and Queries	1100	dp, implementation	54,470	1m 18s	✓
C	Ilya and Matrix	1400	constructive-algorithms, greedy, implementation	5,940	36s	✓
D	Ilya and Roads	2100	dp	1,690	1m 8s	✓
E	Ilya and Two Numbers	2300	constructive-algorithms, data-structures, dsu	599	2m 22s

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

CF 313A - Ilya and Bank Account

The problem centers on Ilya’s bank account balance, which is a signed integer. Positive values indicate savings, and negative values indicate debt.

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

CF 313C - Ilya and Matrix

We are asked to construct a $2 times n times 2 times n$ square matrix from a given list of $4n$ integers such that a recursively defined "beauty" measure is maximized.

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

CF 313E - Ilya and Two Numbers

Codeforces 313E: Ilya and Two Numbers

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

CF 313D - Ilya and Roads

We have a row of holes on a road, numbered from 1 to $n$. Each hole can be repaired by hiring one of $m$ companies.

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

We are given a string composed solely of the characters "." and "". The task is to answer multiple queries efficiently. Each query asks, within a substring from position l to r, how many times a character is immediately followed by an identical character.

Codeforces Round 186 (Div. 2)

Codeforces Round 186 (Div. 2)

CF 313A - Ilya and Bank Account

CF 313C - Ilya and Matrix

CF 313E - Ilya and Two Numbers

CF 313D - Ilya and Roads

CF 313B - Ilya and Queries