Codeforces Round 595 (Div. 3)

9 problems from Codeforces Round 595 (Div. 3) (contest 1249), difficulty 800-2200. 5/9 solutions verified against sample I/O.

9 items

Codeforces Round 595 (Div. 3)

Div. 3 | 9 problems | 5/9 verified | Difficulty 800-2200 | 43m 43s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Yet Another Dividing into Teams	800	math	23,707	2m 20s	✓
B1	Books Exchange (easy version)	1000	dsu, math	22,287	5m 26s
B2	Books Exchange (hard version)	1300	dfs-and-similar, dsu, math	18,391	4m 6s
C1	Good Numbers (easy version)	1300	brute-force, greedy, implementation	16,554	4m 31s	✓
C2	Good Numbers (hard version)	1500	binary-search, greedy, math	13,532	1m 37s
D1	Too Many Segments (easy version)	1800	greedy	5,507	5m 17s	✓
D2	Too Many Segments (hard version)	1800	data-structures, greedy, sortings	5,776	8m 52s
E	By Elevator or Stairs?	1700	dp, shortest-paths	10,992	5m 34s	✓
F	Maximum Weight Subset	2200	dp, trees	2,745	6m	✓

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

CF 1249F - Maximum Weight Subset

We are given a tree where each vertex carries a positive weight. The task is to select a subset of vertices that maximizes the sum of chosen weights, but with a strict geometric restriction: any two selected vertices must be more than $k$ edges apart in the tree.

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

CF 1249E - By Elevator or Stairs?

We are given a building with floors from 1 to n. Moving between adjacent floors can be done in two different ways: stairs or elevator. Stairs have per-floor costs a[i], and elevator has per-floor costs b[i] plus a fixed overhead c every time you start an elevator ride.

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

CF 1249D1 - Too Many Segments (easy version)

We are given a collection of integer intervals on a number line. Each interval represents coverage over all integer points inside its range. A point becomes problematic if it is covered by more than $k$ intervals at the same time.

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

CF 1249C2 - Good Numbers (hard version)

We are given several independent queries. Each query provides a large integer $n$, and we must output the smallest integer $m ge n$ such that $m$ can be expressed as a sum of distinct powers of 3.

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

CF 1249B1 - Books Exchange (easy version)

Each child starts with exactly one book, and every day all books are passed simultaneously according to a fixed permutation. If a child i gives their book to p[i], then after one day the book moves one step along this directed edge.

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

CF 1249C1 - Good Numbers (easy version)

We are working with numbers that can be decomposed using a very specific building system: powers of three, where each power can be used at most once.

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

CF 1249B2 - Books Exchange (hard version)

We are given a system where each child initially holds a unique book, and every day each book is passed to another fixed child according to a permutation. After one day, every book moves once; after two days, it moves again under the same rule, and so on.

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

CF 1249D2 - Too Many Segments (hard version)

We are given a collection of integer segments on a number line. Each segment covers every integer point between its endpoints. A point becomes problematic if it is covered by more than $k$ segments at the same time.

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

CF 1249A - Yet Another Dividing into Teams

We are given several independent scenarios. In each scenario there is a list of distinct integers representing student skill levels.