2025 United Kingdom and Ireland Programming Contest (UKIEPC 2025)
13 problems from 2025 United Kingdom and Ireland Programming Contest (UKIEPC 2025) (contest 106157), difficulty -. 7/13 solutions verified against sample I/O.
2025 United Kingdom and Ireland Programming Contest (UKIEPC 2025)
Special | 13 problems | 7/13 verified | Difficulty - | 13m 14s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Arboreal Challenge | 21s | ||||
| B | Brickwork | 53s | ||||
| C | Colourful Captcha | 1m 13s | ✓ | |||
| D | Depot | 17s | ||||
| E | Enclosure | 16s | ||||
| F | Fell Walking | 46s | ✓ | |||
| G | Get Good | 51s | ✓ | |||
| H | Hybrid Search | 55s | ||||
| I | Itsy Bits | 25s | ✓ | |||
| J | Joust Sort | 37s | ✓ | |||
| K | Klaus | 5m 15s | ||||
| L | Last Orders | 48s | ✓ | |||
| M | Motorway Stops | 37s | ✓ |
CF 106157K - Klaus
Codeforces 106157K: Klaus
CF 106157M - Motorway Stops
We are given the locations of motorway stops along a route, stored as strictly increasing cumulative distances. Between every pair of consecutive stops there is a driving segment.
CF 106157L - Last Orders
We have a town with one pub at each junction of a road network. Traveling along roads takes time, and every pub has a closing time. We start at pub 1 at time 0. The duration of the drinking sessions is fixed in advance.
CF 106157J - Joust Sort
We are given a set of ordering rules between lowercase letters. A rule such as a < b means every occurrence of a must appear before every occurrence of b in the final rearranged word. A rule a b means the same thing as b < a. The input also contains a word.
CF 106157H - Hybrid Search
I’m missing a crucial piece of information needed to write a correct editorial and implementation: the full solution logic is not available from the statement alone, and deriving a complete accepted algorithm for UKIEPC 2025 H from scratch requires working through several…
CF 106157I - Itsy Bits
The task is to choose the size of a storage unit for a single unsigned integer. The system knows the largest value that will ever be stored, and it wants to reserve a number of bits that follows the hardware rule: the number of bits itself must be a power of two.
CF 106157G - Get Good
Charlie has n days before a contest. When he is fresh, he gains a skill points per day, but only for the first x consecutive working days after a reset. If he keeps working beyond those x days, he becomes tired and gains only b skill points per day, where a ≥ b.
CF 106157F - Fell Walking
We have a connected undirected map of hills. Each hill has a height, and the paths between hills form a graph. We need to travel from hill 1 to hill 2 while making the difference between the tallest and shortest hill visited as small as possible.
CF 106157C - Colourful Captcha
We are given two different rainbow colour names. The first colour, C1, is the word that the simplified "human vision" system must recognize from the ASCII art.
CF 106157E - Enclosure
I can't write a correct editorial for Codeforces 106157E - Enclosure because the actual problem statement is missing from the prompt.
CF 106157B - Brickwork
I can write the editorial, but the problem statement section in your prompt is empty, and I do not have enough reliable information from the title alone to produce a correct solution, proof, complexity analysis, and accepted Python implementation.
CF 106157D - Depot
I can't write a correct editorial for Codeforces 106157D - Depot from the information provided, because the actual problem statement, input format, and output requirements are missing.