Codeforces Round 579 (Div. 3)

Solutions for Codeforces Round 579 (Div. 3) (contest 1203). 8/8 problems verified against sample I/O. Difficulty range: 1000-2300.

8 items

Codeforces Round 579 (Div. 3)

Type: Div. 3 | Problems: 8 | Verified: 8/8 | Rating range: 1000-2300 | Time: 28m 41s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Circle of Students	1000	implementation	7m	✓
B	Equal Rectangles	1200	greedy, math	1m 55s	✓
C	Common Divisors	1300	implementation, math	1m 39s	✓
D1	Remove the Substring (easy version)	1600	greedy, implementation	4m 44s	✓
D2	Remove the Substring (hard version)	1700	binary-search, greedy, implementation	5m 33s	✓
E	Boxers	1500	greedy, sortings	1m 17s	✓
F1	Complete the Projects (easy version)	2100	greedy	1m 47s	✓
F2	Complete the Projects (hard version)	2300	dp, greedy	4m 46s	✓

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

CF 1203F2 - Complete the Projects (hard version)

Each project can be thought of as an action that becomes available only when Polycarp’s current rating is high enough. Once he starts a project, his rating may go up or down, but it is never allowed to become negative at any point.

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

CF 1203D2 - Remove the Substring (hard version)

We are given two strings, s and t. The second string is guaranteed to already appear inside the first one as a subsequence, meaning we can pick characters from s in order and obtain t.

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

CF 1203A - Circle of Students

We are given several independent scenarios. In each scenario, a group of students is arranged in a fixed circular order, and we are shown that order as a linear list representing clockwise traversal around the circle.

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

CF 1203D1 - Remove the Substring (easy version)

We are given a source string s and a target string t, where t is already guaranteed to be a subsequence of s. In other words, we can pick characters from s in order and obtain t without reordering anything.

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

CF 1203F1 - Complete the Projects (easy version)

Polycarp is a freelancer with an initial rating r. He has a list of projects, each project defined by two numbers: the minimum rating required to start it, and the rating change after completion, which could be positive or negative.

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

CF 1203E - Boxers

We are given a set of boxers, each with a positive integer weight. Each boxer can adjust their weight by at most 1, either up or down, but the weight must remain strictly positive.

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

CF 1203B - Equal Rectangles

We are given 4n sticks. Every rectangle requires four sticks: two sticks for one side length and two sticks for the other side length. Every stick must be used exactly once. The goal is to split all sticks into exactly n rectangles such that every rectangle has the same area.

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

CF 1203C - Common Divisors

We are asked to find the number of positive integers that evenly divide every number in a given array. The array can contain up to 400,000 elements, each of which can be as large as $10^{12}$. Conceptually, we are looking for the set of common divisors of all array elements.