2023-2024 CTU Open Contest

12 problems from 2023-2024 CTU Open Contest (contest 104767), difficulty -. 10/12 solutions verified against sample I/O.

12 items

2023-2024 CTU Open Contest

Special | 12 problems | 10/12 verified | Difficulty - | 14m 38s

#	Problem	Time	✓
A	Beth's Cookies	1m 8s	✓
B	Clubbing	1m 33s	✓
C	Digitalisation	1m 31s
D	Expressions	1m 35s	✓
E	Fragmentation	1m 6s	✓
F	Golem Coordinated Derby	1m 20s	✓
G	Hamster	33s
H	Movers	1m 19s	✓
I	Natatorium	1m 3s	✓
J	Proglute	1m 17s	✓
K	Screamers in the Storm	1m 9s	✓
L	Wall	1m 4s	✓

Practice › Codeforces Solutions › 2023-2024 CTU Open Contest ›

CF 104767C - Digitalisation

Each student arrives with two ranked preferences over schools. Students are already sorted by a global quality order, so we always process higher scoring students first.

Practice › Codeforces Solutions › 2023-2024 CTU Open Contest ›

CF 104767G - Hamster

We are given a set of unit segments drawn on the integer grid. Each segment connects two grid intersection points that are exactly one step apart horizontally or vertically.

Practice › Codeforces Solutions › 2023-2024 CTU Open Contest ›

CF 104767J - Proglute

We are given $N$ labeled points placed on a circle, with every possible string drawn as a straight segment between two distinct points, but only some sets of strings are allowed.

Practice › Codeforces Solutions › 2023-2024 CTU Open Contest ›

CF 104767F - Golem Coordinated Derby

We are given a multiset of up to 100000 robots, each labeled by a height between 1 and 20. From this multiset we must build a single linear ordering of all robots, and we also choose one robot to be the first element of this order, called the captain.

Practice › Codeforces Solutions › 2023-2024 CTU Open Contest ›

CF 104767D - Expressions

We are given a fixed arithmetic expression consisting of a sequence of integers interleaved with operators, where the operators are addition, subtraction, and multiplication.

Practice › Codeforces Solutions › 2023-2024 CTU Open Contest ›

CF 104767K - Screamers in the Storm

We are working in a discrete geometric setting. Imagine a sphere centered at the origin in a $D$-dimensional integer lattice. Every lattice point whose Euclidean distance from the origin is at most $R$ is considered “inside or on the surface” of the sphere.

Practice › Codeforces Solutions › 2023-2024 CTU Open Contest ›

CF 104767L - Wall

We are given a one-dimensional binary array representing a row of cells. Each cell is either inactive, shown as a dot, or active, shown as an X. Starting from this initial configuration, we repeatedly evolve the row for a fixed number of steps.

Practice › Codeforces Solutions › 2023-2024 CTU Open Contest ›

CF 104767H - Movers

We are working with a collection of labs connected by undirected “neighbour” relations. Each lab initially contains some number of desks and monitors. Over time, these counts change because we add desks or monitors to individual labs.

Practice › Codeforces Solutions › 2023-2024 CTU Open Contest ›

CF 104767I - Natatorium

We are given a target surface area $C$, which is guaranteed to be the product of two distinct primes. Alongside this, we are given a list of $M$ available side lengths, where every element in the list is also a prime number.

Practice › Codeforces Solutions › 2023-2024 CTU Open Contest ›

CF 104767E - Fragmentation

We are given a long sequence of machines over days, where each day provides a machine with a fixed “splitting power.

Practice › Codeforces Solutions › 2023-2024 CTU Open Contest ›

CF 104767B - Clubbing

We are given a fixed sequence of students that PCC will talk to over time. Each position in this sequence corresponds to a moment, and each character is a student identifier from a small alphabet.

Practice › Codeforces Solutions › 2023-2024 CTU Open Contest ›

CF 104767A - Beth's Cookies

The input describes a walk in a tree-like structure encoded as a sequence of balanced parentheses. Every opening bracket corresponds to moving into a newly discovered room or revisiting a room from a deeper part of the traversal, while every closing bracket corresponds to…