Codeforces Round 743 (Div. 1)

Solutions for Codeforces Round 743 (Div. 1) (contest 1572). 2/6 problems verified against sample I/O. Difficulty range: 1800-3400.

6 items

Codeforces Round 743 (Div. 1)

Type: Div. 1 | Problems: 6 | Verified: 2/6 | Rating range: 1800-3400 | Time: 15m 52s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Book	1800	binary-search, brute-force, data-structures	2m 29s	✗
B	Xor of 3	2500	brute-force, constructive-algorithms, greedy	1m 49s	✗
C	Paint	2700	dp, greedy	5m 37s	✗
D	Bridge Club	2800	flows, graph-matchings, graphs	1m 21s	✓
E	Polygon	3000	binary-search, dp, geometry	2m 30s	✗
F	Stations	3400	data-structures	2m 6s	✓

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

CF 1572C - Paint

We have a one dimensional image represented by an array of colors. A single operation chooses a connected monochromatic segment and repaints the entire segment to any color. The connectivity definition is slightly unusual.

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

CF 1572F - Stations

We have a row of cities, each of which can host a broadcasting station. Each station has a height and a range. A station can reach cities to its right up to its range limit, but it is blocked by any taller station in between.

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

CF 1572D - Bridge Club

We are given a universe of $2^n$ players, where each player is identified by an $n$-bit mask. Each bit represents whether that player has a positive or negative opinion on a topic.

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

CF 1572B - Xor of 3

We are given a sequence of 0s and 1s and an operation that can change any three consecutive elements to the XOR of those three elements.