Технокубок 2021 - Финал

Solutions for Технокубок 2021 - Финал (contest 1482). 2/8 problems verified against sample I/O. Difficulty range: 800-3400.

8 items

Технокубок 2021 - Финал

Type: Special | Problems: 8 | Verified: 2/8 | Rating range: 800-3400 | Time: 28m 17s

Problem Name Rating Tags Solve Time Verified
A Prison Break 800 math 1m 52s ✓
B Restore Modulo 1500 implementation, math 2m 49s ✗
C Basic Diplomacy 1600 brute-force, constructive-algorithms, greedy 6m 8s ✗
D Playlist 1900 data-structures, dsu, implementation 2m 10s ✗
E Skyline Photo 2100 data-structures, divide-and-conquer, dp 2m 58s ✗
F Useful Edges 2400 graphs, shortest-paths 3m 12s ✓
G Vabank 3200 binary-search, interactive 2m 59s ✗
H Exam 3400 data-structures, string-suffix-structures, trees 6m 9s ✗
Practice › Codeforces Solutions › Технокубок 2021 - Финал ›

CF 1482H - Exam

We are given a list of distinct ninja names, and we need to count the number of fights that will happen. A fight occurs between two ninjas if one ninja's name is a substring of the other's, and there is no third ninja whose name is also a substring of the larger name and…
codeforces competitive-programming data-structures string-suffix-structures trees Jun 10, 2026
Practice › Codeforces Solutions › Технокубок 2021 - Финал ›

CF 1482G - Vabank

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.
codeforces competitive-programming binary-search interactive Jun 10, 2026
Practice › Codeforces Solutions › Технокубок 2021 - Финал ›

CF 1482F - Useful Edges

We are given an undirected weighted graph with up to 600 vertices and up to about 180,000 edges, where each edge has a positive weight. Then we are given a list of queries, each consisting of a pair of vertices $u$ and $v$ and a number $l$.
codeforces competitive-programming graphs shortest-paths Jun 10, 2026
Practice › Codeforces Solutions › Технокубок 2021 - Финал ›

CF 1482C - Basic Diplomacy

We have m days. On each day, a specific set of friends is available, and we must choose exactly one available friend for that day. The assignment must satisfy a fairness condition. Let limit = ceil(m / 2). No friend may be chosen more than limit times across all days.
codeforces competitive-programming brute-force constructive-algorithms greedy implementation Jun 10, 2026
Practice › Codeforces Solutions › Технокубок 2021 - Финал ›

CF 1482E - Skyline Photo

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.
codeforces competitive-programming data-structures divide-and-conquer dp Jun 10, 2026
Practice › Codeforces Solutions › Технокубок 2021 - Финал ›

CF 1482D - Playlist

We are asked to simulate a playlist with songs labeled by genres, where Arkady listens to songs in order, cycling back to the beginning when reaching the end.
codeforces competitive-programming data-structures dsu implementation shortest-paths Jun 10, 2026
Practice › Codeforces Solutions › Технокубок 2021 - Финал ›

CF 1482B - Restore Modulo

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.
codeforces competitive-programming implementation math Jun 10, 2026
Practice › Codeforces Solutions › Технокубок 2021 - Финал ›

CF 1482A - Prison Break

We are given a prison represented as a rectangular grid of size a × b. Each cell is isolated by walls on all four sides except the perimeter, which leads to freedom.
codeforces competitive-programming math Jun 10, 2026