Kotlin Heroes: Episode 14

9 problems from Kotlin Heroes: Episode 14 (contest 2199), difficulty 1000-3000. 3/9 solutions verified against sample I/O.

9 items

Kotlin Heroes: Episode 14

Kotlin | 9 problems | 3/9 verified | Difficulty 1000-3000 | 18m 48s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Game	1000	*special	1,334	3m 16s	✓
B	Two Towers	1400	*special, greedy, math	874	1m 11s	✓
C	Minesweeper	1600	*special, constructive-algorithms, greedy	408	2m 3s
D	Two Arrays	1800	*special, math	276	1m 51s	✓
E	Supersequence	2100	*special, binary-search, greedy	181	2m 1s
F	Self-Produced Sequences	2000	*special, combinatorics, math	149	2m 36s
G	Jammer	2500	*special, math	58	2m 1s
H	Sum of MEX	2300	*special, combinatorics, data-structures	90	1m 54s
I	Strange Process	3000	*special	34	1m 55s

Practice › Codeforces Solutions › Kotlin Heroes: Episode 14 ›

CF 2199I - Strange Process

We start with a very constrained system: one array begins as all ones, another array is all zeros, and a third array c provides a sequence of target values between 1 and 50.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 14 ›

CF 2199H - Sum of MEX

We are given an array of length $n$ where each element is an integer from $-1$ to $n$. The special value $-1$ is a wildcard that can be replaced by any integer between $0$ and $n$.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 14 ›

CF 2199F - Self-Produced Sequences

We are given an integer array and asked to count subsequences that are "self-produced." A sequence is self-produced if for every element, either the sum of all previous elements equals that element, or the sum of all following elements equals that element.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 14 ›

CF 2199G - Jammer

We are asked to find positions on a rectangular grid where we can place a jammer such that it always intercepts a robot moving from the bottom-left corner $(0,0)$ to the top-right corner $(n,m)$, while remaining invisible at the start and end points.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 14 ›

CF 2199E - Supersequence

We are given an initial array $a$, and we want to imagine building a longer array $b$ that contains all elements of $a$ in order (not necessarily consecutively), but between every pair of adjacent elements in $b$, the values must differ by exactly 1.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 14 ›

CF 2199A - Game

Alice and Bob play a three-round card game where each round has independent scores between 0 and a maximum k. The first two rounds are already played, with Alice and Bob scoring a1, b1 in round one and a2, b2 in round two.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 14 ›

CF 2199D - Two Arrays

We are given two arrays, each sorted in non-decreasing order, and each having an odd number of elements. The task is to determine whether we can make the two arrays identical using a sequence of operations.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 14 ›

CF 2199C - Minesweeper

We are asked to build a grid with exactly two rows and some number of columns. Each cell can either contain a mine or be empty.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 14 ›

CF 2199B - Two Towers

We start with two stacks of blocks. The first stack has height a, the second has height b. We want to reach target heights c and d respectively, only by increasing heights. There are two allowed operations. The first operation increases exactly one of the towers by one block.