Codeforces Round 636 (Div. 3)

4 problems from Codeforces Round 636 (Div. 3) (contest 1343), difficulty 800-2400. 3/4 solutions verified against sample I/O.

4 items

Codeforces Round 636 (Div. 3)

Div. 3 | 4 problems | 3/4 verified | Difficulty 800-2400 | 25m 9s

#	Problem	Rating	Tags	Accepted	Time	✓
B	Balanced Array	800	constructive-algorithms, math	65,109	17m 57s	✓
C	Alternating Subsequence	1200	dp, greedy, two-pointers	44,059	1m 19s	✓
E	Weights Distributing	2100	brute-force, graphs, greedy	5,737	2m 40s	✓
F	Restore the Permutation by Sorted Segments	2400	brute-force, constructive-algorithms, data-structures	1,402	3m 13s

Practice › Codeforces Solutions › Codeforces Round 636 (Div. 3) ›

CF 1343F - Restore the Permutation by Sorted Segments

We are given an unknown permutation of numbers from 1 to n. Instead of seeing it directly, we receive n−1 pieces of information, each piece being a multiset segment taken from the permutation.

Practice › Codeforces Solutions › Codeforces Round 636 (Div. 3) ›

CF 1343E - Weights Distributing

We are given a connected undirected graph where each edge represents a road, but the roads do not yet have fixed costs. Instead, we are also given a list of prices, and we must assign exactly one price to each edge.

Practice › Codeforces Solutions › Codeforces Round 636 (Div. 3) ›

CF 1343B - Balanced Array

We are asked to construct an array of length $n$ where the first half consists of distinct even positive integers, the second half consists of distinct odd positive integers, and the sums of the two halves are equal.

Practice › Codeforces Solutions › Codeforces Round 636 (Div. 3) ›

CF 1343C - Alternating Subsequence

We are given a sequence of integers, both positive and negative, and need to construct a subsequence whose elements strictly alternate in sign. Among all subsequences that achieve the maximum possible length, we are asked to find the one with the largest sum.