VK Cup 2022 - Финальный раунд (Engine)

Solutions for VK Cup 2022 - Финальный раунд (Engine) (contest 1784). 4/6 problems verified against sample I/O. Difficulty range: 1000-3400.

6 items

VK Cup 2022 - Финальный раунд (Engine)

Type: Special | Problems: 6 | Verified: 4/6 | Rating range: 1000-3400 | Time: 13m 24s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Monsters (easy version)	1000	brute-force, greedy	3m 17s	✗
B	Letter Exchange	1900	constructive-algorithms	2m 1s	✓
C	Monsters (hard version)	2200	data-structures, greedy	2m 42s	✗
D	Wooden Spoon	2400	combinatorics, dp	1m 47s	✓
E	Infinite Game	3100	brute-force, combinatorics, dp	2m 10s	✓
F	Minimums or Medians	3400	-	1m 27s	✓

Practice › Codeforces Solutions › VK Cup 2022 - Финальный раунд (Engine) ›

CF 1784E - Infinite Game

We are given a short string consisting of characters that can be interpreted as decisions in a repeated competitive process. Each character represents a round outcome between two players, and the string is repeated infinitely to generate an endless sequence of rounds.

Practice › Codeforces Solutions › VK Cup 2022 - Финальный раунд (Engine) ›

CF 1784F - Minimums or Medians

We are given the set of consecutive integers from 1 to 2n. Vika performs exactly k operations on this set. Each operation consists of either removing the two smallest integers or removing the two middle integers, which are the two integers at positions n and n+1 if the set is…

Practice › Codeforces Solutions › VK Cup 2022 - Финальный раунд (Engine) ›

CF 1784D - Wooden Spoon

We are asked to count, for each player in a single-elimination tournament of size $2^n$, the number of ways they can end up with a "Wooden Spoon." The tournament is deterministic: whenever two players meet, the one with the smaller number always wins.

Practice › Codeforces Solutions › VK Cup 2022 - Финальный раунд (Engine) ›

CF 1784A - Monsters (easy version)

We are given several independent scenarios. In each scenario, there are $n$ monsters arranged conceptually in a line, and each monster has some integer health value. A monster disappears once its health reaches zero. We can perform two kinds of actions.

Practice › Codeforces Solutions › VK Cup 2022 - Финальный раунд (Engine) ›

CF 1784C - Monsters (hard version)

We are asked to find the minimum number of single-target damage spells needed to kill monsters in a game, where a powerful area-of-effect spell can also be cast once.

Practice › Codeforces Solutions › VK Cup 2022 - Финальный раунд (Engine) ›

CF 1784B - Letter Exchange

Each person starts with exactly three letters chosen from w, i, and n. Across all people combined, there are exactly m copies of each letter, so globally the supply is already balanced. The only issue is that the letters are distributed unevenly among individuals.