Codeforces Round 149 (Div. 2)

Solutions for Codeforces Round 149 (Div. 2) (contest 242). 3/5 problems verified against sample I/O. Difficulty range: 1100-2100.

5 items

Codeforces Round 149 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 1100-2100 | Time: 12m 58s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Heads or Tails	1100	brute-force, implementation	3m 26s	✓
B	Big Segment	1100	implementation, sortings	1m 12s	✓
C	King's Path	1800	dfs-and-similar, graphs, hashing	3m 11s	✗
D	Dispute	2100	dfs-and-similar, graphs, greedy	1m 37s	✗
E	XOR on Segment	2000	bitmasks, data-structures	3m 32s	✓

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

CF 242A - Heads or Tails

We know how many times each player flipped a coin. Vasya flipped x times and Petya flipped y times. Every head gives one point, every tail gives nothing. Valera does not remember the exact final scores, but he remembers three facts.

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

CF 242B - Big Segment

We are given a list of segments on a number line, each defined by a left and right endpoint. The task is to find if there exists a single segment among them that fully contains every other segment.

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

CF 242C - King's Path

We are given a huge implicit grid, up to $10^9 times 10^9$, but only a small subset of cells are usable. Each usable region is given as a horizontal segment: a row number and a contiguous interval of columns.

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

CF 242D - Dispute

We are given a graph of counters, where each counter starts at zero and is connected by undirected wires. Pressing a button on a counter increases its own value by one, and also increases the value of every directly connected neighbor by one.

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

CF 242E - XOR on Segment

We are maintaining a mutable array of integers where two types of operations are performed repeatedly: range sum queries and range updates where every element in a subarray is XORed with a fixed value.