Kotlin Heroes: Episode 7

10 problems from Kotlin Heroes: Episode 7 (contest 1533), difficulty -. 9/10 solutions verified against sample I/O.

10 items

Kotlin Heroes: Episode 7

Kotlin | 10 problems | 9/10 verified | Difficulty - | 43m 35s

# Problem Rating Tags Accepted Time ✓
A Travel to Bertown *special, implementation, math 1,130 4m 13s ✓
B Nearest Point Function *special, implementation 816 4m 12s ✓
C Sweets *special, data-structures, implementation 484 4m 14s ✓
D String Searching *special, hashing 514 3m 31s ✓
E Chess Team Forming *special, binary-search, data-structures 285 3m 12s ✓
F Binary String Partition *special, binary-search, greedy 224 4m 3s ✓
G Biome Map *special, constructive-algorithms, dfs-and-similar 98 5m 39s
H Submatrices *special, bitmasks, data-structures 92 4m 23s ✓
I Excursions *special, constructive-algorithms, dfs-and-similar 61 7m 26s ✓
J Pawns *special 52 2m 42s ✓
Practice › Codeforces Solutions › Kotlin Heroes: Episode 7 ›

CF 1533I - Excursions

We can view the situation as a two-layer directed routing process between two bipartite sets of nodes. One set corresponds to sights in Saratov, the other to sights in Engels.
codeforces competitive-programming *special constructive-algorithms dfs-and-similar flows graph-matchings graphs Jun 14, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 7 ›

CF 1533G - Biome Map

We are given a small grid of biome “types”, where each type is identified by a pair of parameters coming from a fixed $n times m$ table. Some of these pairs exist and are assigned a unique integer identifier, while others are unavailable.
codeforces competitive-programming *special constructive-algorithms dfs-and-similar graphs Jun 14, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 7 ›

CF 1533H - Submatrices

We are working with a grid of uppercase letters, but the alphabet is extremely small: only the first five letters appear.
codeforces competitive-programming *special bitmasks data-structures dp Jun 14, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 7 ›

CF 1533D - String Searching

We are given a fixed collection of strings, all of the same length, and we are asked to answer many queries about a slightly longer string. Each stored string has length $m$. Each query string has length $m+1$.
codeforces competitive-programming *special hashing Jun 14, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 7 ›

CF 1533C - Sweets

We are given a circular arrangement of sweets labeled from 1 to n. Each sweet is either “liked” or “not liked”. Anya performs a deterministic process that removes sweets one by one from the circle. The process has two phases in every test case.
codeforces competitive-programming *special data-structures implementation Jun 14, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 7 ›

CF 1533A - Travel to Bertown

Vika arrives in Bertown on a fixed day $k$. She has several friends, and each friend offers a single continuous interval of days during which she can stay at their home.
codeforces competitive-programming *special implementation math Jun 14, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 7 ›

CF 1533B - Nearest Point Function

We are given several test cases, each consisting of a sorted array of distinct integers. Think of these numbers as fixed points on a number line. A query point $y$ is chosen, and a function returns the closest point in the array to $y$ based on absolute distance.
codeforces competitive-programming *special implementation Jun 14, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 7 ›

CF 1533J - Pawns

We are given an infinite chessboard with black pawns placed at certain integer coordinates. Our goal is to capture all black pawns using as few white pawns as possible.
codeforces competitive-programming *special Jun 10, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 7 ›

CF 1533F - Binary String Partition

We are given a binary string. For a fixed value of $k$, a substring is considered valid if at least one of the two character counts is small: either it contains at most $k$ zeroes or at most $k$ ones.
codeforces competitive-programming *special binary-search greedy Jun 10, 2026
Practice › Codeforces Solutions › Kotlin Heroes: Episode 7 ›

CF 1533E - Chess Team Forming

We are tasked with forming a chess team by adding one final player to Polycarp's existing roster of $n$ members. Each player's strength is an integer, and the opposing team already has $n+1$ members.
codeforces competitive-programming *special binary-search data-structures greedy Jun 10, 2026