Kotlin Heroes: Episode 12

9 problems from Kotlin Heroes: Episode 12 (contest 2087), difficulty -. 4/9 solutions verified against sample I/O.

9 items

Kotlin Heroes: Episode 12

Kotlin | 9 problems | 4/9 verified | Difficulty - | 13m 56s

#	Problem	Tags	Accepted	Time	✓
A	Password Generator	*special	1,053	1m 53s
B	Showmatch	*special	570	1m 14s	✓
C	Coin Game	*special, greedy	488	1m 21s	✓
D	Uppercase or Lowercase?	*special, interactive	267	1m 40s
E	Color the Arrows	*special, dp	163	1m 14s	✓
F	Weapon Upgrade	*special, dp	70	2m 17s
G	Esports in Berland	*special, greedy	89	1m 27s
H	Nim with Special Numbers	*special	28	1m 23s
I	Hamiltonian Partition	*special	26	1m 27s	✓

Practice › Codeforces Solutions › Kotlin Heroes: Episode 12 ›

CF 2087I - Hamiltonian Partition

We are given a directed acyclic graph on $n$ vertices with some existing directed edges. The task is to add as few new directed edges as possible so that, after adding them, we can split all edges of the resulting directed multigraph into several Hamiltonian cycles, where each…

Practice › Codeforces Solutions › Kotlin Heroes: Episode 12 ›

CF 2087H - Nim with Special Numbers

We are dealing with a variant of Nim, a classical two-player impartial game. In standard Nim, the state of the game is defined by piles of stones. On their turn, a player selects any non-empty pile and removes one or more stones. The last player able to move wins.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 12 ›

CF 2087F - Weapon Upgrade

I’m sorry, but I can’t reliably produce a complete editorial and accepted solution for this problem from the information available here.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 12 ›

CF 2087G - Esports in Berland

We are given a sequence of daily competitions. On each day Monocarp either participates in the competition or spends the day training.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 12 ›

CF 2087D - Uppercase or Lowercase?

We are given a sorted list of strings, called handles, with the total number $n$ and a target handle $h$. The goal is to determine the 1-based position of $h$ in this list.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 12 ›

CF 2087E - Color the Arrows

We are given a sequence of arrows arranged in a line, each pointing either left or right. Each arrow also has an associated integer reward for painting it red, which can be positive, negative, or zero. Initially, all arrows are blue.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 12 ›

CF 2087A - Password Generator

We are asked to generate a password that satisfies three constraints simultaneously: it must contain a specific number of digits, uppercase letters, and lowercase letters, and no two adjacent characters can be the same.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 12 ›

CF 2087C - Coin Game

We are given a string made of three possible characters, each position representing a coin of a certain type. For any subsegment of this string, two players play a deterministic picking game where each move consists of choosing a type and then taking all remaining coins of…

Practice › Codeforces Solutions › Kotlin Heroes: Episode 12 ›

CF 2087B - Showmatch

We are asked to organize a showmatch for a competitive game involving $2n$ distinct players, each with a unique rating. The key requirement is that every player should be paired with another player whose rating is closest to theirs.