Kotlin Heroes: Episode 13

Solutions for Kotlin Heroes: Episode 13 (contest 2141). 4/9 problems verified against sample I/O. Difficulty range: 800-3500.

9 items

Kotlin Heroes: Episode 13

Type: Kotlin | Problems: 9 | Verified: 4/9 | Rating range: 800-3500 | Time: 14m 33s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Furniture Store	800	*special, implementation	1m 16s	✓
B	Games	1200	*special, greedy	1m 22s	✗
C	Minimum on Subarrays	1800	*special, brute-force	1m 19s	✓
D	Avoid Minimums	1800	*special, greedy, math	56s	✗
E	Perfect Cut	2100	*special, dp, greedy	3m	✗
F	Array Reduction	2200	*special, greedy	2m 30s	✗
G	Good Robot Paths	2800	*special, data-structures, geometry	1m 24s	✗
H	Merging Vertices in a Graph	2700	*special, dfs-and-similar, dsu	1m 20s	✓
I	Color the Tree	3500	*special	1m 26s	✓

Practice › Codeforces Solutions › Kotlin Heroes: Episode 13 ›

CF 2141F - Array Reduction

Working

Practice › Codeforces Solutions › Kotlin Heroes: Episode 13 ›

The symptom here is actually very clear from the input/output pair: You are giving permutations, and the expected outputs are: But a correct inversion-counting or monotonic-feasibility solution would never produce those values.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 13 ›

CF 2141G - Good Robot Paths

We are given a set of black points on a Cartesian plane, each with integer coordinates. A robot can move up, down, left, or right by one unit per command.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 13 ›

CF 2141B - Games

Two players each maintain a fixed sorted list of games they enjoy. They do not immediately know which common game to pick, so they go through a deterministic alternating process of suggesting games they personally like, one at a time, without repeating any suggestion.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 13 ›

CF 2141D - Avoid Minimums

Our systems have detected unusual activity coming from your system. Please try again later.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 13 ›

CF 2141I - Color the Tree

We are working with a tree where every vertex starts uncolored. In one move, we pick any two vertices, possibly the same vertex twice, and we “recolor” every vertex on the unique path between them.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 13 ›

CF 2141H - Merging Vertices in a Graph

We start with an undirected simple graph on $n$ vertices. The graph evolves through an operation that removes two existing vertices and replaces them with a new vertex whose neighborhood is exactly the intersection of the neighborhoods of the removed vertices.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 13 ›

CF 2141C - Minimum on Subarrays

The problem asks us to simulate a special structure that supports adding and removing elements from both ends, along with a min operation that accumulates the minimum of all current elements into a running sum.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 13 ›

CF 2141A - Furniture Store

We are given a list of sofa models, each positioned on a website in a fixed order. Every model has a price, and every customer scans the list from left to right, picking the first sofa whose price does not exceed their budget.

Kotlin Heroes: Episode 13

Kotlin Heroes: Episode 13

CF 2141F - Array Reduction

CF 2141E - Perfect Cut

CF 2141G - Good Robot Paths

CF 2141B - Games

CF 2141D - Avoid Minimums

CF 2141I - Color the Tree

CF 2141H - Merging Vertices in a Graph

CF 2141C - Minimum on Subarrays

CF 2141A - Furniture Store