Codeforces Round 547 (Div. 3)

Solutions for Codeforces Round 547 (Div. 3) (contest 1141). 5/8 problems verified against sample I/O. Difficulty range: 900-1900.

8 items

Codeforces Round 547 (Div. 3)

Type: Div. 3 | Problems: 8 | Verified: 5/8 | Rating range: 900-1900 | Time: 14m 2s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Game 23	1000	implementation, math	1m 35s	✓
B	Maximal Continuous Rest	900	implementation	1m 12s	✓
C	Polycarp Restores Permutation	1500	math	1m 23s	✓
D	Colored Boots	1500	greedy, implementation	3m 17s	✗
E	Superhero Battle	1700	math	1m 35s	✓
F1	Same Sum Blocks (Easy)	1900	greedy	1m 44s	✗
F2	Same Sum Blocks (Hard)	1900	data-structures, greedy	1m 44s	✗
G	Privatization of Roads in Treeland	1900	binary-search, constructive-algorithms, dfs-and-similar	1m 32s	✓

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

CF 1141G - Privatization of Roads in Treeland

We are given a tree with $n$ vertices and $n-1$ edges. Every edge must be assigned a company number. A city is considered good if all roads incident to it belong to different companies. A city becomes bad if at least two incident roads receive the same company.

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

CF 1141F2 - Same Sum Blocks (Hard)

We are given a one-dimensional array of integers, and we want to split it into contiguous subarrays, which we call blocks. Each block must have the same sum of its elements, and no two blocks can overlap.

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

CF 1141D - Colored Boots

We are given two sets of boots: one left set and one right set, each containing exactly $n$ boots. Each boot has a color, either a specific lowercase letter or a question mark representing an unknown color.

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

CF 1141F1 - Same Sum Blocks (Easy)

We are given an array of integers and may choose several contiguous subarrays, called blocks. Every chosen block must have exactly the same sum, and no two chosen blocks may overlap.

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

CF 1141E - Superhero Battle

We are given a monster with an initial health value and a repeating damage pattern applied once per minute. The pattern has length n, and after the last minute we immediately loop back to the first minute and continue forever.

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

CF 1141A - Game 23

We start with a number and want to reach a larger target number. The only allowed operation is multiplying the current value by 2 or by 3. The task is to determine how many operations are needed, or report that the transformation cannot be done.

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

CF 1141C - Polycarp Restores Permutation

We are given a sequence of differences between consecutive elements of an unknown permutation. More precisely, if the permutation is $p1, p2, dots, pn$, we are given an array $q$ of length $n-1$ such that each $qi = p{i+1} - pi$.

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

CF 1141B - Maximal Continuous Rest

We are given a binary sequence representing a single day, where each position corresponds to an hour. A value of 1 means Polycarp is resting during that hour, while 0 means he is working.