Codeforces Round 661 (Div. 3)

Solutions for Codeforces Round 661 (Div. 3) (contest 1399). 4/7 problems verified against sample I/O. Difficulty range: 800-2300.

7 items

Codeforces Round 661 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 4/7 | Rating range: 800-2300 | Time: 18m 12s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Remove Smallest	800	greedy, sortings	1m 29s	✓
B	Gifts Fixing	800	greedy	1m 29s	✓
C	Boats Competition	1200	brute-force, greedy, two-pointers	1m 23s	✓
D	Binary String To Subsequences	1500	constructive-algorithms, data-structures, greedy	1m 32s	✓
E1	Weights Division (easy version)	2000	data-structures, dfs-and-similar, greedy	7m 46s	✗
E2	Weights Division (hard version)	2200	binary-search, dfs-and-similar, greedy	2m 22s	✗
F	Yet Another Segments Subset	2300	data-structures, dp, graphs	2m 11s	✗

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

CF 1399E1 - Weights Division (easy version)

Thanks - now we can carefully diagnose this. The crash happens here: with the error: The input is: Breaking it down: - 3 → number of test cases T = 3 Test case 1: Test case 2: So clearly the input is hierarchical, not every line has the same number of numbers.

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

CF 1399F - Yet Another Segments Subset

We are given a collection of segments on a number line, each defined by a left endpoint and a right endpoint. The task is to select the largest possible subset of these segments with a specific property: for any two segments in the subset, they must either be completely…

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

CF 1399B - Gifts Fixing

We are given n gifts, where each gift consists of a certain number of candies and a certain number of oranges. Each gift i has ai candies and bi oranges. Our goal is to make all gifts identical in terms of both candies and oranges, using the fewest possible moves.

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

CF 1399E2 - Weights Division (hard version)

We are given a tree rooted at vertex 1, where each edge has a weight and an associated cost of either 1 or 2 coins.

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

CF 1399D - Binary String To Subsequences

We are given a binary string and we want to break it into several subsequences so that every character is used exactly once, and each subsequence alternates between 0 and 1. In other words, inside any chosen subsequence, no two adjacent chosen characters can be equal.

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

CF 1399A - Remove Smallest

We are asked to determine if we can reduce an array of positive integers to a single element using a specific operation: choose two distinct elements whose difference is at most one and remove the smaller of the two (or either if they are equal).

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

CF 1399C - Boats Competition

We have a set of participants, each with a specific weight. The competition only allows two-person teams, and each team must have the same combined weight. Our goal is to form as many teams as possible for a given set of participants.