Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2)
8 problems from Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2) (contest 2222), difficulty -. 0/8 solutions verified against sample I/O.
Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2)
Div. 1+2 | 8 problems | 0/8 verified | Difficulty - | 16m 52s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | A Wonderful Contest | brute-force, dp, math | 9,884 | 2m 3s | ||
| B | Artistic Balance Tree | greedy, sortings | 7,195 | 3m 30s | ||
| C | Median Partition | dp, math | 4,710 | 2m 14s | ||
| D | Permutation Construction | constructive-algorithms, data-structures, sortings | 3,142 | 1m 54s | ||
| E | Seek the Truth | binary-search, bitmasks, constructive-algorithms | 1,915 | 1m 57s | ||
| F | Building Tree | data-structures, divide-and-conquer, dsu | 555 | 1m 37s | ||
| G | Statistics on Tree | binary-search, brute-force, dfs-and-similar | 151 | 1m 43s | ||
| H | Counting Sort? | brute-force, combinatorics, dp | 102 | 1m 54s |
CF 2222H - Counting Sort?
We are asked to count arrays with a property defined recursively. Given an array of integers, each bounded individually by a corresponding ri, we define a transformation f(b) that counts how many times each integer appears in b.
CF 2222G - Statistics on Tree
We are working with a tree where each pair of vertices defines a path. For any pair of nodes $(u, v)$, we look at the unique simple path connecting them and then imagine removing all edges on that path from the tree.
CF 2222F - Building Tree
We start with a weighted undirected graph on n vertices. The twist is that distance between two nodes is not the usual shortest path sum. Instead, if you take any path and look at the set of edge weights used on that path, the cost of the path is the mex of that set.
CF 2222E - Seek the Truth
We are interacting with a hidden transformation on integers in the range from 0 to $2^n - 1$. Behind the scenes there is a fixed bitmask $c$ and a hidden operation type $k in {1,2,3}$. Every time we insert a number $x$, the judge does not insert $x$ itself.
CF 2222D - Permutation Construction
We are given an array a of n integers, which can be positive, negative, or zero. The task is to construct a permutation p of length n - a sequence containing all integers from 1 to n exactly once - such that the "beauty" of the permutation is maximized.
CF 2222B - Artistic Balance Tree
We are given an array of integers and a sequence of operations. Each operation consists of two conceptual parts: first, you can swap elements symmetrically around any chosen center in the array, effectively letting you reorder elements in a controlled way; second, you mark a…
CF 2222C - Median Partition
We are given a sequence of positive integers of odd length. The task is to divide this sequence into contiguous subarrays, each of odd length, such that all these subarrays share the same median. Our goal is to maximize the number of subarrays in such a partition.
CF 2222A - A Wonderful Contest
We are asked to determine whether a programming contest is “wonderful” in the sense that every possible integer total score between 0 and 100 n can be achieved. The contest has n problems, and each problem is divided into ai subtasks.