2024-2025 ICPC Southwestern European Regional Contest (SWERC 2024)
13 problems from 2024-2025 ICPC Southwestern European Regional Contest (SWERC 2024) (contest 105677), difficulty -. 13/13 solutions verified against sample I/O.
2024-2025 ICPC Southwestern European Regional Contest (SWERC 2024)
ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 11m 23s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Titanomachy | 51s | ✓ | |||
| B | Divine Gifting | 1m 1s | ✓ | |||
| C | Phryctoria | 49s | ✓ | |||
| D | Temple Architecture | 48s | ✓ | |||
| E | Building the Fort | 49s | ✓ | |||
| F | Yaxchil\u00e1n Maze | 1m 10s | ✓ | |||
| G | Guess How the Ballet Will End | 46s | ✓ | |||
| H | The king of SWERC | 43s | ✓ | |||
| I | Divination | 49s | ✓ | |||
| J | Recovering the Tablet | 1m 2s | ✓ | |||
| K | Disk Covering | 57s | ✓ | |||
| L | The Charioteer | 1m 1s | ✓ | |||
| M | Ook? Ook! | 37s | ✓ |
CF 105677L - The Charioteer
We are controlling a chariot moving on an infinite integer grid. The starting state is fixed at the origin, and each second we choose a direction for the chariot.
CF 105677M - Ook? Ook!
We are given a word written in a very restricted alphabet consisting only of the characters O and K. This word is not meant to be processed directly as text. Instead, it must be translated into a sequence of symbols from a pseudo-Morse system that only uses two characters: .
CF 105677J - Recovering the Tablet
The grid is partially partitioned by black cells into horizontal and vertical segments. Every white cell belongs to exactly one maximal horizontal segment and exactly one maximal vertical segment. Each such segment has a prescribed sum, given in the input.
CF 105677K - Disk Covering
We are given several disks drawn on a plane. Each disk is a filled circle, defined by a center point and a radius. The disks act like regions that become dangerous, and we are interested in the geometry of the remaining safe space.
CF 105677I - Divination
We are given a collection of N objects, each object representing a paper. Every paper contains a list of references to other papers, forming a directed graph where an arrow goes from a paper to each paper it cites.
CF 105677G - Guess How the Ballet Will End
We are given a one-dimensional stage of length R, where valid positions run from 0 to R. A group of dancers exists, but we never see their initial positions. We only know that every dancer repeatedly applies the same sequence of horizontal moves.
CF 105677H - The king of SWERC
We are given a sequence of names representing votes in an election. Each line corresponds to one vote for a candidate, and each candidate is identified by a single uppercase string. The task is to determine which candidate received strictly more votes than every other candidate.
CF 105677F - Yaxchilán Maze
We are given a collection of rooms connected over time by corridors that appear and disappear. Each corridor becomes available at a specific hour and remains usable for a fixed duration of $M$ hours, after which it vanishes.
CF 105677E - Building the Fort
We are given a set of N distinct lattice points on a huge integer grid. These points are mandatory: they must appear as vertices of a simple polygon we construct.
CF 105677D - Temple Architecture
We are given a line of towers, each positioned at integer coordinates from left to right, with a height assigned to every position. All heights are distinct, so there is a unique tallest tower.
CF 105677B - Divine Gifting
We are given a collection of gifts, each with a preferred “ideal” delivery day. For every gift, we must choose an actual delivery day. That chosen day is not allowed to be earlier than its ideal day, but it can be later.
CF 105677A - Titanomachy
We are given a sequence of numbers representing the current “power balance” between two armies arranged in pairs. Each position contributes an integer value, and that value can change over time in a uniform way across the entire array. Two operations happen online.
CF 105677C - Phryctoria
We are given two strings, a source string $S$ and a target string $T$. Lusius wants to transmit a shortened version of $S$ using a very unusual compression rule: any substring of $S$ can be replaced by a special wildcard character .