Kotlin Heroes: Episode 6

Solutions for Kotlin Heroes: Episode 6 (contest 1488). 2/10 problems verified against sample I/O. Difficulty range: 900-3100.

10 items

Kotlin Heroes: Episode 6

Type: Kotlin | Problems: 10 | Verified: 2/10 | Rating range: 900-3100 | Time: 29m 52s

Problem	Name	Rating	Tags	Solve Time	Verified
A	From Zero To Y	900	*special, math	2m 11s	✗
B	RBS Deletion	1800	*special, greedy	2m 59s	✓
C	Two Policemen	1900	*special, binary-search, brute-force	2m 52s	✗
D	Problemsolving Marathon	1900	*special, binary-search, greedy	2m 13s	✓
E	Palindromic Doubles	2200	*special, data-structures, dp	2m 52s	✗
F	Dogecoin	2300	*special, binary-search, data-structures	3m 5s	✗
G	Painting Numbers	2500	*special, data-structures, greedy	2m 33s	✗
H	Build From Suffixes	2800	*special, combinatorics, data-structures	3m 9s	✗
I	Demonic Invasion	3100	*special, flows	5m 30s	✗
J	Flower Shop	3100	*special, data-structures, fft	2m 28s	✗

Practice › Codeforces Solutions › Kotlin Heroes: Episode 6 ›

CF 1488I - Demonic Invasion

The task describes a graph of islands connected by bidirectional bridges, where a disaster spreads outward from island 1 one layer per day.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 6 ›

We are managing a flower shop with n types of flowers, each with a fixed price. The shop starts empty, and a sequence of m operations is performed, either adding flowers to inventory, removing them, or asking for a count of distinct bouquets.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 6 ›

CF 1488H - Build From Suffixes

We are asked to construct strings of length $n$ using only the letters "a", "b", "c", and "d". For each position $i$ from $1$ to $n-1$, we are given a constraint $ai$.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 6 ›

CF 1488G - Painting Numbers

We are given a set of n distinct integers, each from 1 to n. The task is to assign each number a color, red or blue, such that exactly k numbers are red. The cost of a coloring is defined by counting all pairs (x, y) where x is blue, y is red, and y is divisible by x.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 6 ›

CF 1488F - Dogecoin

Ann wants to maximize profit by mining and selling Dogecoin over a period of days. She earns exactly one coin per day she mines, and the price of a coin varies each day according to a given list.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 6 ›

CF 1488E - Palindromic Doubles

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 6 ›

CF 1488D - Problemsolving Marathon

We are asked to construct a non-decreasing sequence of integers over a fixed number of days, where each day represents how many problems Polycarp solves.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 6 ›

CF 1488B - RBS Deletion

We are given a string of parentheses that is guaranteed to form a regular bracket sequence. Our goal is to repeatedly remove parts of the string according to two operation types until the string becomes empty.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 6 ›

CF 1488C - Two Policemen

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.

Practice › Codeforces Solutions › Kotlin Heroes: Episode 6 ›

CF 1488A - From Zero To Y

We start from zero and want to reach a target value using two kinds of increments. One increment is very small and uniform: we can always add 1 to the current value.

Kotlin Heroes: Episode 6

Kotlin Heroes: Episode 6

CF 1488I - Demonic Invasion

CF 1488J - Flower Shop

CF 1488H - Build From Suffixes

CF 1488G - Painting Numbers

CF 1488F - Dogecoin

CF 1488E - Palindromic Doubles

CF 1488D - Problemsolving Marathon

CF 1488B - RBS Deletion

CF 1488C - Two Policemen

CF 1488A - From Zero To Y