Almaty Code Cup 2024

11 problems from Almaty Code Cup 2024 (contest 105271), difficulty -. 11/11 solutions verified against sample I/O.

11 items

Almaty Code Cup 2024

Special | 11 problems | 11/11 verified | Difficulty - | 9m 38s

#	Problem	Time	✓
A	ACC triangle	52s	✓
B	Guess an array	50s	✓
C	Trains 2	52s	✓
D	Beautiful triplets	51s	✓
E	Blasted hedgehogs!	53s	✓
F	Minim and his struggle	49s	✓
G	Leba Non and meals	50s	✓
H	Railgun and anime-like points	54s	✓
I	topoLogical problem	1m	✓
J	Star Union and Cyber-viruses	58s	✓
K	MnTm	49s	✓

Practice › Codeforces Solutions › Almaty Code Cup 2024 ›

CF 105271C - Trains 2

We are given a tree with vertices labeled from 1 to n. Each vertex acts like a train station, and moving along any edge between two stations costs exactly one ticket. The twist is that tickets are not globally fixed in price.

Practice › Codeforces Solutions › Almaty Code Cup 2024 ›

CF 105271J - Star Union and Cyber-viruses

We are given a tree with $n$ vertices, and a collection of $m$ distinct “virus types”. Each virus type behaves like a multi-source spreading process on the tree: once a virus is inserted at a vertex, it spreads outward along edges in unit time per edge, effectively forming…

Practice › Codeforces Solutions › Almaty Code Cup 2024 ›

CF 105271I - topoLogical problem

We are building a closed walk on an infinite grid starting from the origin, initially facing east. The walk consists of exactly $n$ straight moves.

Practice › Codeforces Solutions › Almaty Code Cup 2024 ›

CF 105271H - Railgun and anime-like points

We are given a fixed set of points on the plane. From this set, we are allowed to pick some points and mark them as special.

Practice › Codeforces Solutions › Almaty Code Cup 2024 ›

CF 105271E - Blasted hedgehogs!

We are given a sequence of hedgehogs, each arriving at a known time and staying in a clearing for a fixed duration $T$. While a hedgehog is present, it can be removed by an action called “throwing food”.

Practice › Codeforces Solutions › Almaty Code Cup 2024 ›

CF 105271G - Leba Non and meals

We are given a directed structure over $n$ cages where each cage has exactly one outgoing tunnel leading to another cage.

Practice › Codeforces Solutions › Almaty Code Cup 2024 ›

CF 105271D - Beautiful triplets

We are given an array of length n where each position stores a small positive integer. A valid structure is a triple of indices i, j, k with i < j < k such that the values form a strict decreasing divisibility chain: a[i] is divisible by a[j], and a[j] is divisible by a[k]…

Practice › Codeforces Solutions › Almaty Code Cup 2024 ›

CF 105271B - Guess an array

We are dealing with a hidden array that is already sorted in non-decreasing order. Every element lies between 1 and n, and we are allowed to ask targeted questions about individual positions.

Practice › Codeforces Solutions › Almaty Code Cup 2024 ›

CF 105271K - MnTm

We are given a grid of seats with n rows and m columns. Each cell contains a cost, and picking a seat means paying that cost. AAlikhan wants to choose exactly k + 1 seats (himself plus k friends) such that the total cost does not exceed a budget B.

Practice › Codeforces Solutions › Almaty Code Cup 2024 ›

CF 105271F - Minim and his struggle

Minim has a sequence of n hours before an exam. At each hour, exactly one activity is possible: either eating or sleeping, depending on a given string. A character e means he is allowed to eat in that hour, and s means he is allowed to sleep.

Practice › Codeforces Solutions › Almaty Code Cup 2024 ›

CF 105271A - ACC triangle

We are given two types of resources: one type represents single “A” pieces and the other represents “C” pieces. Using these, we want to build a triangular structure where row i contains exactly one A followed by i−1 C’s. So the structure grows row by row.