2023 United Kingdom and Ireland Programming Contest (UKIEPC 2023)
14 problems from 2023 United Kingdom and Ireland Programming Contest (UKIEPC 2023) (contest 104785), difficulty -. 14/14 solutions verified against sample I/O.
2023 United Kingdom and Ireland Programming Contest (UKIEPC 2023)
Special | 14 problems | 14/14 verified | Difficulty - | 13m 8s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Assessment Disruption | 49s | ✓ | |||
| B | Boat Commuter | 51s | ✓ | |||
| C | Clearing Space | 1m 4s | ✓ | |||
| D | Delivery Forces | 53s | ✓ | |||
| E | Enchanted Fortress | 1m 15s | ✓ | |||
| F | Fast Forward | 44s | ✓ | |||
| G | Glacier Travel | 57s | ✓ | |||
| H | History in Numbers | 56s | ✓ | |||
| I | International Travel | 54s | ✓ | |||
| J | Journey of Recovery | 1m 13s | ✓ | |||
| K | Kernel Scheduler | 56s | ✓ | |||
| L | Last One Standing | 58s | ✓ | |||
| M | Mini-Tetris 3023 | 48s | ✓ | |||
| N | Naming Wine Bottles | 50s | ✓ |
CF 104785J - Journey of Recovery
The input describes a collection of flights, each with a departure airport, a departure time, an arrival airport, and an arrival time.
CF 104785G - Glacier Travel
Two hikers move along the same polyline path in the plane. The path is given as a sequence of points connected by straight segments, forming a piecewise linear curve that can self-intersect.
CF 104785A - Assessment Disruption
A very simple construction is enough. Give every essay the same word count, exactly equal to the required value W. Then every essay has deviation 0, so dominance depends only on quality.
CF 104785N - Naming Wine Bottles
Each input line describes a wine bottle volume written as a decimal number followed by the letter L. Different lines may describe exactly the same quantity even if they look different syntactically, for example 1.0L and 1L represent the same value.
CF 104785M - Mini-Tetris 3023
We are given a collection of small polyomino pieces that can be rotated freely and placed on a grid that is exactly 2 cells tall and infinitely long to the right, but in practice we only care about forming a finite 2 × n rectangle.
CF 104785L - Last One Standing
Two players each control a single combat unit. Each unit repeatedly fires missiles at a fixed interval. A shot does not apply damage instantly, it lands half a second after being fired. Once a unit has fired, it must wait its reload time before it can fire again.
CF 104785K - Kernel Scheduler
We are given a directed graph where each task is a vertex and each dependency is a directed edge. An edge a - b means task a must be executed before task b.
CF 104785I - International Travel
We are given two rigid structures in the plane: a plug and a socket. Each structure consists of three circular pins or holes. Each circle has a center and a radius, and within each structure the three circles are pairwise disjoint.
CF 104785H - History in Numbers
We are given a long sequence of integers representing an “urban development index” over time. This array is not static. Two types of operations happen online.
CF 104785F - Fast Forward
We are given a circular playlist consisting of n songs, each with a fixed duration. Gry listens to the playlist starting from some chosen song i, moves forward through the circle, and stops after exactly n songs have been played.
CF 104785E - Enchanted Fortress
We are given a set of symbols, each symbol appearing exactly once in a string. From these symbols we choose a subset, and the order of chosen symbols is irrelevant, only which ones are included matters.
CF 104785D - Delivery Forces
We are given a company with $n$ couriers, where $n$ is guaranteed to be divisible by three. Each courier has a strength value, and we must partition all couriers into exactly $k = n/3$ groups, each group containing exactly three people.
CF 104785C - Clearing Space
We are given a set of fixed positions on the boundary of a unit circular clearing, where each position is described by an angle in degrees. Think of these positions as allowed anchor points where fence posts may be installed.
CF 104785B - Boat Commuter
We are simulating a tap-in tap-out transport system where each passenger uses a numbered travel card. Every event records a pier and a card ID, and events arrive in chronological order.