Codeforces Round 1002 (Div. 2)

6 problems from Codeforces Round 1002 (Div. 2) (contest 2059), difficulty 800-2900. 1/6 solutions verified against sample I/O.

6 items

Codeforces Round 1002 (Div. 2)

Div. 2 | 6 problems | 1/6 verified | Difficulty 800-2900 | 10m 41s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Milya and Two Arrays	800	constructive-algorithms, greedy, sortings	29,187	1m 47s	✓
B	Cost of the Array	1300	brute-force, constructive-algorithms, greedy	18,786	1m 46s
C	Customer Service	1600	brute-force, constructive-algorithms, graph-matchings	12,531	1m 45s
D	Graph and Graph	1900	data-structures, graphs, greedy	6,561	2m
E1	Stop Gaming (Easy Version)	2500	brute-force, constructive-algorithms, greedy	886	1m 49s
E2	Stop Gaming (Hard Version)	2900	brute-force, constructive-algorithms, data-structures	350	1m 34s

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

CF 2059E2 - Stop Gaming (Hard Version)

We are given multiple arrays of equal length and we are asked to transform them into a target configuration using a very specific operation.

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

CF 2059D - Graph and Graph

We are given two connected, undirected graphs that share the same set of vertices. Each graph has a token placed on one vertex initially: in the first graph at vertex s1 and in the second at vertex s2. We can repeatedly move each token along one edge in its respective graph.

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

CF 2059C - Customer Service

The problem presents a scenario where there are n queues, initially empty, and a sequence of n discrete moments. At each moment, every queue receives a certain number of new customers.

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

CF 2059E1 - Stop Gaming (Easy Version)

We are given a sequence of arrays, each of length $m$, and we need to transform them into another target sequence of arrays using a special operation.

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

CF 2059A - Milya and Two Arrays

We are given two arrays, a and b, of length n, where each array is "good" - meaning every value in the array occurs at least twice. Milya can rearrange a in any order, then she will compute a new array c where each element is the sum of the corresponding elements from a and b.

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

CF 2059B - Cost of the Array

We are given an array and asked to cut it into exactly k consecutive non-empty segments. Since every element must belong to exactly one segment, this is purely a partition of the array into contiguous blocks.