Codeforces Round 520 (Div. 2)

6 problems from Codeforces Round 520 (Div. 2) (contest 1062), difficulty 1300-2900. 4/6 solutions verified against sample I/O.

6 items

Codeforces Round 520 (Div. 2)

Div. 2 | 6 problems | 4/6 verified | Difficulty 1300-2900 | 22m 46s

#	Problem	Rating	Tags	Accepted	Time	✓
A	A Prank	1300	greedy, implementation	9,306	2m 47s	✓
B	Math	1500	greedy, math, number-theory	9,890	7m 36s	✓
C	Banh-mi	1600	greedy, implementation, math	5,950	3m 30s
D	Fun with Integers	1800	dfs-and-similar, graphs, implementation	4,170	2m 39s	✓
E	Company	2300	binary-search, data-structures, dfs-and-similar	2,063	2m 22s	✓
F	Upgrading Cities	2900	dfs-and-similar, graphs	982	3m 52s

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

CF 1062F - Upgrading Cities

We are given a directed acyclic graph of cities connected by one-way roads. From the constraints, the graph has no directed cycles, so it behaves like a partial order: some cities are comparable through reachability, and others are incomparable.

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

CF 1062B - Math

We are given a single integer as a starting point, and we are allowed to transform it using two operations. One operation multiplies the current number by any positive integer we choose, effectively letting us inflate the number arbitrarily.

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

CF 1062E - Company

The company hierarchy forms a rooted tree where employee 1 is the root, and every other employee has exactly one direct boss. This defines a parent relationship and also induces depths from the root, where depth is the number of edges from employee 1.

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

CF 1062D - Fun with Integers

We are given a set of integers from the range of absolute values 2 up to n, and each number also has its negative counterpart available. Think of every integer i in this range as a node in a graph, including both i and -i.

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

CF 1062C - Banh-mi

We are given a binary array where each position has a value of either zero or one. We repeatedly remove elements from a chosen segment, and every time we remove an element, two things happen: we gain its value immediately, and all remaining elements in that segment get…

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

CF 1062A - A Prank

We are given a strictly increasing array of integers, all between 1 and 1000. Someone is allowed to erase exactly one contiguous block of elements, leaving a gap in the sequence. The remaining elements stay in their original positions.