Kotlin Heroes: Episode 2

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

9 items

Kotlin Heroes: Episode 2

Kotlin | 9 problems | 6/9 verified | Difficulty 1000-3100 | 23m 44s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Three Problems	1000	*special, implementation	1,583	1m 42s
B	Traveling Around the Golden Ring of Berland	1500	*special, implementation	800	1m 38s	✓
C	Ice Cream	1700	*special, greedy, sortings	567	1m 16s	✓
D	Teams	2000	*special, binary-search, greedy	252	6m 33s	✓
E	Double Permutation Inc.	2000	*special, binary-search, greedy	216	3m 59s
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	1m 35s
I	Unusual Graph	3000	*special, graphs	52	2m 22s	✓

Practice › Codeforces Solutions › Kotlin Heroes: Episode 2 ›

CF 1211E - Double Permutation Inc.

We are given a sequence of integers and must assign each position one of three colors: red, green, or blue. After coloring, we look only at red elements in their original order; they must form a permutation of consecutive integers starting from 1.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 2 ›

CF 1211H - Road Repair in Treeland

We are given a tree where each edge represents a road between two cities. Every road must be assigned to a company, and multiple roads can share the same company.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 2 ›

CF 1211A - Three Problems

We are given a list of problem difficulties, where each problem has an index and a numeric complexity value. The task is to select three distinct indices $a$, $b$, and $c$ such that the corresponding values form a strictly increasing chain: $ra < rb < rc$.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 2 ›

CF 1211C - Ice Cream

We are given a sequence of days, and on each day there is a price for buying a single ice cream portion. Each day also comes with constraints describing how many portions Tanya is allowed to eat on that day.

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 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.