Codeforces Round 916 (Div. 3)

Solutions for Codeforces Round 916 (Div. 3) (contest 1914). 3/9 problems verified against sample I/O. Difficulty range: 800-2300.

9 items

Codeforces Round 916 (Div. 3)

Type: Div. 3 | Problems: 9 | Verified: 3/9 | Rating range: 800-2300 | Time: 17m 46s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Problemsolving Log	800	implementation, strings	2m 3s	✓
B	Preparing for the Contest	800	constructive-algorithms, math	2m 26s	✗
C	Quests	1100	greedy, math	2m 2s	✓
D	Three Activities	1200	brute-force, dp, greedy	1m 56s	✗
E1	Game with Marbles (Easy Version)	1400	brute-force, games, greedy	2m 34s	✓
E2	Game with Marbles (Hard Version)	1400	games, greedy, sortings	2m 43s	✗
F	Programming Competition	1900	dfs-and-similar, dp, graph-matchings	2m 36s	✗
G1	Light Bulbs (Easy Version)	2100	brute-force, combinatorics, dfs-and-similar	50s	✗
G2	Light Bulbs (Hard Version)	2300	combinatorics, data-structures, dfs-and-similar	36s	✗

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

CF 1914G2 - Light Bulbs (Hard Version)

We are given a row of $2n$ light bulbs, with each color from $1$ to $n$ appearing exactly twice. All bulbs start turned off. We are allowed to initially turn on any subset $S$ of bulbs.

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

CF 1914F - Programming Competition

We are given a company hierarchy with n employees, where the first employee is the head, and every other employee has exactly one direct superior. This naturally forms a rooted tree with the head as the root.

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

CF 1914E1 - Game with Marbles (Easy Version)

Each color is an independent pile of marbles owned by both players. A move chooses a color that still exists on both sides. Suppose color i is chosen by Alice. Alice throws away exactly one of her marbles of that color, while Bob loses all bi marbles of that color.

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

CF 1914G1 - Light Bulbs (Easy Version)

We are given a row of 2n light bulbs, with exactly two bulbs of each color from 1 to n. All bulbs start turned off. We can pick an initial set S of bulbs to turn on.

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

CF 1914E2 - Game with Marbles (Hard Version)

Alice and Bob each have collections of marbles in $n$ colors. Alice's collection is represented as an array $a$, and Bob's as an array $b$, where $ai$ and $bi$ denote the number of marbles of color $i$ each player has.

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

CF 1914D - Three Activities

Each test case gives three arrays of equal length, where each index represents a day in a holiday period. On any given day, Monocarp has three independent “options”: how many friends would join if he goes skiing that day, how many would join for a movie that day, and how…

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

CF 1914B - Preparing for the Contest

We have problems with difficulties 1 through n. We must arrange these numbers into a permutation that represents the order in which Monocarp solves them. Whenever a problem is harder than the immediately previous problem in the chosen order, Monocarp becomes excited.

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

CF 1914A - Problemsolving Log

Monocarp's contest log is a string of length $n$ where the $i$-th character represents the problem he was working on during minute $i$. Each problem from 'A' to 'Z' has an associated required time to solve: 'A' takes 1 minute, 'B' 2 minutes, up to 'Z' which takes 26 minutes.

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

CF 1914C - Quests

We are given a sequence of quests arranged in a strict order from 1 to n. The important rule is that quests behave like a chain of unlocks. Quest 1 is always usable. Quest i only becomes usable once every quest before it has been completed at least once.