2024 United Kingdom and Ireland Programming Contest (UKIEPC 2024)
12 problems from 2024 United Kingdom and Ireland Programming Contest (UKIEPC 2024) (contest 105446), difficulty -. 0/12 solutions verified against sample I/O.
2024 United Kingdom and Ireland Programming Contest (UKIEPC 2024)
Special | 12 problems | 0/12 verified | Difficulty - | 22m 48s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Amalgram | 1m 36s | ||||
| B | Budget Analysis | 3m 21s | ||||
| C | Cross Country | 2m 9s | ||||
| D | Drone Control | 1m 31s | ||||
| E | Eradication Sort | 1m 49s | ||||
| F | Finding Suspicious Proteins | 1m 37s | ||||
| G | Word Search | 1m 46s | ||||
| H | Hedge Topiary | 2m 30s | ||||
| I | Inconsistent Patterns | 1m 45s | ||||
| J | Jabber Network | 1m 36s | ||||
| K | Knitting | 1m 31s | ||||
| L | Leg Day | 1m 37s |
CF 105446L - Leg Day
The task describes a repeating training schedule that classifies each day into one of three categories based on textual cues: leg-focused training days, arm-focused training days, and rest days.
CF 105446K - Knitting
We are given a partially constructed sequence representing a knitted scarf. Each position is a color, and some prefix of the scarf is already fixed.
CF 105446J - Jabber Network
We start with a network of $n$ computers connected by exactly $n-1$ cables, so the structure is a tree. Every computer pair has a known communication demand $c{ij}$, and if we route traffic along the unique path in the current tree, the cost contributed by this pair is $c{ij}$…
CF 105446I - Inconsistent Patterns
We need to construct a synthetic dataset that demonstrates a reversal phenomenon across aggregation. There are two teams, and performance is measured over several categories. For each category, we assign how many problems each team attempted and solved.
CF 105446H - Hedge Topiary
We are given two simple polygons, both centered at the origin in the sense that the origin lies strictly inside each of them. The first polygon represents a shape we are allowed to scale uniformly around the origin. The second polygon is a fixed container.
CF 105446G - Word Search
We are given two rectangular character grids. The first grid is a small pattern, and the second grid is a much larger canvas where we want to search for occurrences of that pattern as a contiguous 2D block.
CF 105446F - Finding Suspicious Proteins
We are given a collection of proteins, each represented by a short identifier and a vector of length $l$. You can think of each protein as a point in a low-dimensional integer space, where each coordinate is between 0 and 9.
CF 105446E - Eradication Sort
We are given a sequence of heights laid out in a single row, representing people in a photograph. We are allowed to remove any subset of these people.
CF 105446B - Budget Analysis
We are given a long sequence of paired observations. Each observation represents a month, where one value is advertising spend and the other is resulting sales. From this data, we repeatedly build a simple predictive model of the form of a straight line mapping spend to sales.
CF 105446D - Drone Control
We are controlling a simplified flight controller with four adjustable parameters corresponding to four flaps: north, east, south, and west. Each request gives three desired physical effects: pitch, roll, and yaw.
CF 105446C - Cross Country
We are given a start point, a sequence of line segments that represent checkpoints, and a finish point. A runner moves freely in the plane, and their path is measured as Euclidean length.