Kotlin Heroes: Episode 2

7 problems from Kotlin Heroes: Episode 2 (contest 1211), difficulty 1000-3100. 5/7 solutions verified against sample I/O.

7 items

Kotlin Heroes: Episode 2

Kotlin | 7 problems | 5/7 verified | Difficulty 1000-3100 | 24m 24s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Three Problems	1000	*special, implementation	1,583	5m 5s
B	Traveling Around the Golden Ring of Berland	1500	*special, implementation	800	1m 38s	✓
D	Teams	2000	*special, binary-search, greedy	252	6m 33s	✓
F	kotlinkotlinkotlinkotlin...	2300	*special, graphs, implementation	149	1m 48s	✓
G	King's Path	2500	*special, math, trees	83	2m 51s	✓
H	Road Repair in Treeland	3100	*special, binary-search, dp	57	4m 7s
I	Unusual Graph	3000	*special, graphs	52	2m 22s	✓

Practice › Codeforces Solutions › Kotlin Heroes: Episode 2 ›

CF 1211H - Road Repair in Treeland

We are given a tree where each edge represents a road that must be repaired. Every edge must be assigned a “company label” (an integer ID), and the assignment is subject to a local restriction at every city: if you look at all roads incident to a city, the number of…

Practice › Codeforces Solutions › Kotlin Heroes: Episode 2 ›

CF 1211G - King's Path

We are given a tree where each node initially holds a color. There is also a target color for every node. The King performs a single walk on the tree. During this walk, whenever he traverses an edge, the endpoints of that edge swap their current flags.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 2 ›

CF 1211I - Unusual Graph

We are given an undirected graph with up to 500 vertices. The graph is known to come from a very specific hidden labeling process: each vertex originally had a number between 0 and 15, and an edge existed between two vertices if and only if their labels differ in exactly one…

Practice › Codeforces Solutions › Kotlin Heroes: Episode 2 ›

CF 1211D - Teams

We are given a multiset of player ratings. Each player can be used at most once, and our goal is to form as many disjoint teams as possible under a strict structure constraint. Every valid team consists of two homogeneous groups of players.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 2 ›

CF 1211A - Three Problems

We are given a list of problem difficulties, each tied to its original position in the list. The task is to pick three distinct indices so that their corresponding values form a strictly increasing sequence.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 2 ›

CF 1211F - kotlinkotlinkotlinkotlin...

We are given a collection of string fragments. Originally, all of them came from cutting a long string that consisted of the word "kotlin" repeated several times. After the cuts, the fragments were shuffled.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 2 ›

CF 1211B - Traveling Around the Golden Ring of Berland

We are asked to plan the minimum number of visits for a tourist traveling along a fixed cyclic route of cities. The cities are numbered from 1 to n, arranged in a cycle, and the traveler always moves forward: from city i to i+1, and from city n back to city 1.