2025-2026 ICPC Southwestern European Regional Contest (SWERC 2025)
12 problems from 2025-2026 ICPC Southwestern European Regional Contest (SWERC 2025) (contest 106225), difficulty -. 12/12 solutions verified against sample I/O.
2025-2026 ICPC Southwestern European Regional Contest (SWERC 2025)
ICPC/IOI | 12 problems | 12/12 verified | Difficulty - | 11m 42s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Adjusting Drones | 1m 2s | ✓ | |||
| B | Billion Players Game | 48s | ✓ | |||
| C | Chamber of Secrets 2 | 48s | ✓ | |||
| D | Dungeon Equilibrium | 59s | ✓ | |||
| E | Expansion Plan 2 | 59s | ✓ | |||
| F | Factory Table | 47s | ✓ | |||
| G | Git Gud | 1m 6s | ✓ | |||
| H | Hyper Smawk Bros | 56s | ✓ | |||
| I | Isaac's Queries | 1m 4s | ✓ | |||
| J | Jewels Building | 55s | ✓ | |||
| K | Keygen 3 | 1m 9s | ✓ | |||
| L | LFS | 1m 9s | ✓ |
CF 106225B - Billion Players Game
We are given a range of possible outcomes for a hidden integer value $p$, which represents Godflex’s final ranking. We only know that $p$ lies somewhere in an interval $[l, r]$, and nothing more. Alongside this uncertainty, there are several bookmaker offers.
CF 106225L - LFS
We are given a long string representing a sequence of enemy types in a game level. Each query selects a contiguous segment of this string, and for that segment we must measure how repetitive its internal substrings can be.
CF 106225G - Git Gud
We are given a target number $n$. We must construct a fixed sequence of “missions”. Each mission has two parameters: a difficulty $y$ and a duration $l$. We do not control the initial skill $s$, except that it is some unknown integer in the range $[1, n]$.
CF 106225K - Keygen 3
We are asked to construct permutations of the numbers from 1 to n that satisfy two structural constraints at the same time. First, the permutation must be bitonic, meaning it increases up to some peak position and then decreases afterward.
CF 106225J - Jewels Building
We are given an initial row of crystals, each crystal carrying an integer energy. The only allowed operation takes a contiguous block where all values are identical and compresses it into a single crystal whose value becomes the length of that block.
CF 106225A - Adjusting Drones
We are given a sequence of energy levels assigned to a line of drones. Each drone carries an integer value, and values can repeat across different positions.
CF 106225E - Expansion Plan 2
We start with an infinite integer grid where only the origin cell is active. Over time, we repeatedly expand the set of active cells according to a sequence of operations.
CF 106225H - Hyper Smawk Bros
The game starts with a boss whose health is n. Two players attack alternately and you move first. Every attack deals some integer damage between 1 and m. The only restriction is that a player cannot repeat the amount that the opponent used on the immediately preceding turn.
CF 106225D - Dungeon Equilibrium
We are given an array where each value represents a monster type. A level is considered balanced when every type that remains appears exactly as many times as its own value. For example, if type 4 is present, then it must occur exactly four times.
CF 106225I - Isaac's Queries
We are given a hidden array of length n, where each element is a 30-bit integer chosen uniformly at random. We are allowed to ask queries on any subsegment [u, v], and the system returns a compressed view of the XOR of that segment.
CF 106225F - Factory Table
We are given an array that is claimed to come from a very structured construction. Fix a positive integer $k$. If we list all products $i cdot j$ for $1 le i le k$ and $1 le j le k$, row by row, we obtain a length $k^2$ sequence.