Codeforces Round 167 (Div. 1)

2 problems from Codeforces Round 167 (Div. 1) (contest 273), difficulty 2400-2600. 1/2 solutions verified against sample I/O.

2 items

Codeforces Round 167 (Div. 1)

Div. 1 | 2 problems | 1/2 verified | Difficulty 2400-2600 | 3m 6s

#	Problem	Rating	Tags	Accepted	Time	✓
D	Dima and Figure	2400	dp	478	1m 58s
E	Dima and Game	2600	dp, games	400	1m 8s	✓

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

CF 273D - Dima and Figure

We are given a grid of size n by m where each cell is initially white. Dima can paint any subset of cells black. A painting is considered one of Dima's favorite figures if three conditions are met: at least one cell is painted, all painted cells form a connected set (connected…

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

CF 273E - Dima and Game

We are asked to construct sequences of intervals, each interval defined by two integers (l, r), such that the first player has a guaranteed winning strategy in a specific two-player game.