2022 Benelux Algorithm Programming Contest (BAPC 22)

12 problems from 2022 Benelux Algorithm Programming Contest (BAPC 22) (contest 104020), difficulty -. 8/12 solutions verified against sample I/O.

12 items

2022 Benelux Algorithm Programming Contest (BAPC 22)

Special | 12 problems | 8/12 verified | Difficulty - | 10m 4s

#	Problem	Time	✓
A	Adjusted Average	46s	✓
B	Bellevue	53s	✓
C	Crashing Competition Computer	1m	✓
D	Dividing DNA	43s	✓
E	Equalising Audio	46s	✓
F	Failing Flagship	46s	✓
G	Grinding Gravel	36s
H	House Numbering	48s	✓
I	Imperfect Imperial Units	27s
J	Jagged Skyline	2m 2s
K	Kiosk Construction	56s	✓
L	Lowest Latency	21s

Practice › Codeforces Solutions › 2022 Benelux Algorithm Programming Contest (BAPC 22) ›

CF 104020J - Jagged Skyline

A domino tiling of the $8times 8$ board assigns to each unit square a partner square so that every square belongs to exactly one $1times 2$ or $2times 1$ domino. The additional tatami condition forbids any grid vertex where four different dominoes meet.

Practice › Codeforces Solutions › 2022 Benelux Algorithm Programming Contest (BAPC 22) ›

CF 104020K - Kiosk Construction

We are given a rectangular grid where every cell contains a unique label from 1 to $h cdot w$. Think of the grid as a directed navigation system: from any current cell, a visitor does not move randomly or along shortest paths, but instead follows a deterministic rule that…

Practice › Codeforces Solutions › 2022 Benelux Algorithm Programming Contest (BAPC 22) ›

CF 104020L - Lowest Latency

Codeforces 104020L: Lowest Latency

Practice › Codeforces Solutions › 2022 Benelux Algorithm Programming Contest (BAPC 22) ›

CF 104020I - Imperfect Imperial Units

We are given a collection of conversion rules between abstract measurement units. Each rule states that one unit is equivalent to a scaled amount of another unit.

Practice › Codeforces Solutions › 2022 Benelux Algorithm Programming Contest (BAPC 22) ›

CF 104020H - House Numbering

We are given a connected undirected graph with $n$ intersections. Each edge represents a street between two intersections $u$ and $v$, and each street contains a linear chain of houses.

Practice › Codeforces Solutions › 2022 Benelux Algorithm Programming Contest (BAPC 22) ›

CF 104020G - Grinding Gravel

We are given several gravel stones, each with a positive integer weight. We also have a grid made of identical cells, and each cell must be filled exactly to a fixed capacity $k$.

Practice › Codeforces Solutions › 2022 Benelux Algorithm Programming Contest (BAPC 22) ›

CF 104020F - Failing Flagship

We are given two wind directions written as strings, and each string represents a direction on a circular compass where directions are refined recursively from coarse to fine.

Practice › Codeforces Solutions › 2022 Benelux Algorithm Programming Contest (BAPC 22) ›

CF 104020E - Equalising Audio

We are given a sequence of audio amplitudes. Each amplitude contributes to a notion of “perceived loudness” defined by the square of its value. The system measures average perceived loudness as the mean of these squared values over all positions.

Practice › Codeforces Solutions › 2022 Benelux Algorithm Programming Contest (BAPC 22) ›

CF 104020B - Bellevue

We are given a polyline describing the cross section of an island from west to east. The endpoints lie at sea level and every interior point is strictly above sea level.

Practice › Codeforces Solutions › 2022 Benelux Algorithm Programming Contest (BAPC 22) ›

CF 104020D - Dividing DNA

We are given a binary interface to a hidden database of DNA strings. The only thing we can do is query whether a chosen substring of our query string appears somewhere in that database.

Practice › Codeforces Solutions › 2022 Benelux Algorithm Programming Contest (BAPC 22) ›

CF 104020C - Crashing Competition Computer

We are trying to complete typing a fixed-length program consisting of c characters. Each character takes exactly one unit of time to type. The complication is that after every character is typed, the machine may crash with probability p.

Practice › Codeforces Solutions › 2022 Benelux Algorithm Programming Contest (BAPC 22) ›

CF 104020A - Adjusted Average

We are given a list of numeric measurements, and we are allowed to discard at most a small number of them. After discarding, we compute the average of the remaining values. The goal is to make this resulting average as close as possible to a fixed target value.