MEPhI Spring Cup 2026

7 problems from MEPhI Spring Cup 2026 (contest 106494), difficulty -. 7/7 solutions verified against sample I/O.

7 items

MEPhI Spring Cup 2026

Special | 7 problems | 7/7 verified | Difficulty - | 5m 48s

# Problem Rating Tags Accepted Time ✓
A Random Order 45s ✓
B Rest Point 51s ✓
C Alternative Worlds I 52s ✓
D Alternative Worlds II 49s ✓
E Dark Labyrinth 49s ✓
F Thanos Sort 54s ✓
G Reconstruction 48s ✓
Practice › Codeforces Solutions › MEPhI Spring Cup 2026 ›

CF 106494G - Reconstruction

The input describes a directed structure over numbered vertices where each vertex points to a “nearest” vertex.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › MEPhI Spring Cup 2026 ›

CF 106494E - Dark Labyrinth

We are working with a graph where the process starts from a single distinguished vertex, initially vertex 1, and we maintain a dynamically growing set of vertices, called $c$. Conceptually, $c$ is always treated as a single “compressed” component.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › MEPhI Spring Cup 2026 ›

CF 106494B - Rest Point

We are given several independent intervals, and from each interval we must pick a single value. After choosing one value per interval, we treat those values as magnitudes of vectors.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › MEPhI Spring Cup 2026 ›

CF 106494F - Thanos Sort

We are given an array that can be recursively split into halves, and at each segment we are allowed to decide whether to “stop” or to continue splitting.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › MEPhI Spring Cup 2026 ›

CF 106494D - Alternative Worlds II

We are given an array of numbers and we are allowed to split it into several disjoint groups. For each group, we compute its median, and the score of a partition is the sum of these medians. The task is to choose a partition of the array that maximizes this total score.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › MEPhI Spring Cup 2026 ›

CF 106494C - Alternative Worlds I

We are given a list of integers and we are allowed to split them into several groups. For each group, we compute its median, and the final score is the sum of all these medians. The task is to choose the partition of the array into groups that maximizes this total sum.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › MEPhI Spring Cup 2026 ›

CF 106494A - Random Order

We are given a permutation-like sequence of positions derived from the original array: instead of working with values directly, we only care about the index position of each element in the given ordering. These indices form an array $i1, i2, dots, in$.
codeforces competitive-programming Jun 19, 2026