Codeforces Round 163 (Div. 2)

5 problems from Codeforces Round 163 (Div. 2) (contest 266), difficulty 800-2500. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 163 (Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 800-2500 | 8m 11s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Stones on the Table	800	implementation	244,394	1m 1s	✓
B	Queue at the School	800	constructive-algorithms, graph-matchings, implementation	165,998	1m 12s	✓
C	Below the Diagonal	2100	constructive-algorithms, greedy, math	1,429	1m 46s	✓
D	BerDonalds	2400	graphs, math, shortest-paths	991	2m 6s
E	More Queries to Array...	2500	data-structures, math	1,059	2m 6s

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

CF 266C - Below the Diagonal

We are given an $n times n$ grid that contains exactly $n-1$ ones, with all other cells being zeros. The grid itself is not fixed in place: we are allowed to reorder rows and columns arbitrarily by swapping any two rows or any two columns.

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

CF 266B - Queue at the School

We are given a line of children represented as a string where each character is either a boy or a girl. The line evolves over time in discrete steps. During each second, every adjacent pair where a boy stands immediately before a girl swaps positions simultaneously.

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

CF 266E - More Queries to Array...

We are given an array that changes over time through two kinds of operations. One operation overwrites a whole segment with a single value, effectively erasing previous information inside that interval.

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

CF 266D - BerDonalds

We are given a connected undirected graph representing the roads of Bertown. Junctions are nodes, roads are weighted edges with positive lengths. The task is to choose a location for a new BerDonalds restaurant so that the maximum distance from it to any junction is minimized.

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

CF 266A - Stones on the Table

We are given a row of stones, each painted one of three colors. The goal is to remove as few stones as possible so that after removals, no two adjacent stones share the same color.