Codeforces Round 141 (Div. 2)

Solutions for Codeforces Round 141 (Div. 2) (contest 228). 2/4 problems verified against sample I/O. Difficulty range: 800-2100.

4 items

Codeforces Round 141 (Div. 2)

Type: Div. 2 | Problems: 4 | Verified: 2/4 | Rating range: 800-2100 | Time: 7m 21s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Is your horseshoe on the other hoof?	800	implementation	2m 19s	✓
B	Two Tables	1400	brute-force, implementation	2m 19s	✓
D	Zigzag	2100	data-structures	1m 28s	✗
E	The Road to Berland is Paved With Good Intentions	1900	2-sat, dfs-and-similar, dsu	1m 15s	✗

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

CF 228A - Is your horseshoe on the other hoof?

Valera already owns four horseshoes, and each horseshoe has a color represented by an integer. He wants all four horseshoes to have distinct colors before going to the party. If some colors repeat, he must buy new horseshoes to replace the duplicates.

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

CF 228B - Two Tables

We have two binary grids. A shift (x, y) means that cell (i, j) in the first grid is compared with cell (i + x, j + y) in the second grid. The score of a shift is the number of positions where both cells exist and both contain 1.

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

CF 228D - Zigzag

We are asked to maintain an array of integers while supporting two types of operations: updating a single element to a new value, and computing a weighted sum over a subarray where the weights follow a small repeating zigzag pattern determined by a factor z.

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

CF 228E - The Road to Berland is Paved With Good Intentions

We are asked to bring all roads in Berland to an asphalted state using a special operation. Each road connects two cities and has an initial state: asphalted or not.