Codeforces Round 163 (Div. 2)

Solutions for Codeforces Round 163 (Div. 2) (contest 266). 2/4 problems verified against sample I/O. Difficulty range: 800-2500.

4 items

Codeforces Round 163 (Div. 2)

Type: Div. 2 | Problems: 4 | Verified: 2/4 | Rating range: 800-2500 | Time: 8m 10s

Problem	Name	Rating	Tags	Solve Time	Verified
B	Queue at the School	800	constructive-algorithms, graph-matchings, implementation	1m 21s	✓
C	Below the Diagonal	2100	constructive-algorithms, greedy, math	2m 17s	✗
D	BerDonalds	2400	graphs, math, shortest-paths	2m 9s	✗
E	More Queries to Array...	2500	data-structures, math	2m 23s	✓

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

CF 266B - Queue at the School

We are given a queue made of boys and girls, represented as a string containing only B and G. Every second, each adjacent pair "BG" swaps positions and becomes "GB". The swaps happen simultaneously. That detail matters a lot.

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

CF 266C - Below the Diagonal

We are given an $n times n$ binary matrix with exactly $n-1$ ones. We may swap any two rows or any two columns. The goal is to rearrange the matrix so that every one ends up strictly below the main diagonal. In other words, if a one is located at $(r,c)$, we need $r c$.

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

CF 266D - BerDonalds

We are given a connected weighted undirected graph representing a road network. Junctions are graph vertices, roads are weighted edges, and the restaurant may be placed anywhere, not only at vertices but also at any point along an edge.

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

CF 266E - More Queries to Array...

We maintain an array under two operations. The first operation assigns a constant value to an entire subarray. If we receive = l r x, every position from l through r becomes x. The second operation asks for a weighted sum over a subarray. For a query ?