2024-2025 ICPC NERC, Kyrgyzstan Regional Contest

9 problems from 2024-2025 ICPC NERC, Kyrgyzstan Regional Contest (contest 105493), difficulty -. 9/9 solutions verified against sample I/O.

9 items

2024-2025 ICPC NERC, Kyrgyzstan Regional Contest

ICPC/IOI | 9 problems | 9/9 verified | Difficulty - | 11m 6s

# Problem Rating Tags Accepted Time ✓
A New Functionality 55s ✓
B Scientific Hypotheses 1m 4s ✓
C Tomorrow Will Be Better Than Yesterday 1m 21s ✓
D Conspiracy Theory 58s ✓
E Training Camps 1m 7s ✓
F Volunteering 58s ✓
G Exhausting Training 59s ✓
H Tiring Wait 2m 45s ✓
I Fair Diversity 59s ✓
Practice › Codeforces Solutions › 2024-2025 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 105493C - Tomorrow Will Be Better Than Yesterday

We are given a sequence of points in the plane, and we look at the displacement vectors between consecutive points. Each such vector captures how we move from one point to the next.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 105493H - Tiring Wait

We are simulating a traveler who moves back and forth between two stops, A and B, using two fixed timetables. One timetable lists departure times from A to B, and the other lists departure times from B to A.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 105493I - Fair Diversity

Each establishment receives some number of visits over a fixed number of days. From this history we compute a frequency array $ci$, where each value represents how many times establishment $i$ was visited.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 105493E - Training Camps

We are given a directed acyclic graph where two special vertices act as starting points. From each of these starting vertices, we must construct a path that follows directed edges forward.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 105493G - Exhausting Training

We are modeling a training schedule that improves two independent skills over a number of days. Each skill has an initial level, a target level, and two ways to train it: a normal training mode that increases the skill slowly, and an intensive mode that boosts progress more…
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 105493D - Conspiracy Theory

We are given a sequence of positive integers. After removing duplicates, we are interested in building a directed structure over their positions in increasing index order.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 105493A - New Functionality

The process described in the problem behaves like a two-dimensional counter that advances in a very regular pattern. We start from a current position identified by a pair of values, and each “press” moves this position forward.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 105493F - Volunteering

We are given a fixed large interval on a number line, together with several smaller intervals. Each small interval contributes coverage to some portion of the large interval.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024-2025 ICPC NERC, Kyrgyzstan Regional Contest ›

CF 105493B - Scientific Hypotheses

We are given a sequential process of “reactions” indexed from 1 to n. At each step i, we assign a value p[i], and this value is constrained from above by a global limit pmax.
codeforces competitive-programming Jun 23, 2026