2023-2024 ICPC, Swiss Subregional

11 problems from 2023-2024 ICPC, Swiss Subregional (contest 104854), difficulty -. 11/11 solutions verified against sample I/O.

11 items

2023-2024 ICPC, Swiss Subregional

ICPC/IOI | 11 problems | 11/11 verified | Difficulty - | 9m 53s

#	Problem	Time	✓
A	Arthur The Ant	1m 5s	✓
B	Beautiful Contest	56s	✓
C	Continued Fractions	56s	✓
D	District 42	47s	✓
E	Elimination Bracket	54s	✓
F	Factorial Prime	46s	✓
G	Guess Gauss	46s	✓
H	Homogeneous Mixings	56s	✓
I	Intelligent Cat Embedding	56s	✓
J	Judging Gifts	59s	✓
K	Kenough Time	52s	✓

Practice › Codeforces Solutions › 2023-2024 ICPC, Swiss Subregional ›

CF 104854K - Kenough Time

We are given a 2D continuous world split into two movement regimes by the horizontal line $y = 0$. Points with $y ge 0$ are land where Ken moves at speed $v{run}$, and points with $y < 0$ are sea where he moves at speed $v{swim}$, with $v{run} ge v{swim}$.

Practice › Codeforces Solutions › 2023-2024 ICPC, Swiss Subregional ›

CF 104854J - Judging Gifts

We can think of the situation as a directed graph where each gift type is a node and each possible exchange is a directed edge with a positive cost representing effort.

Practice › Codeforces Solutions › 2023-2024 ICPC, Swiss Subregional ›

CF 104854I - Intelligent Cat Embedding

We are given a fixed embedding space of size $k$. Every sentence we construct is a sequence of words, and each word acts like a set of deterministic “write operations” on this embedding vector. We start from a zero vector of length $k$.

Practice › Codeforces Solutions › 2023-2024 ICPC, Swiss Subregional ›

CF 104854H - Homogeneous Mixings

We are given a multiset of colored particles, where each particle is represented by a lowercase letter. The input string is already sorted, so equal letters appear in contiguous blocks.

Practice › Codeforces Solutions › 2023-2024 ICPC, Swiss Subregional ›

CF 104854G - Guess Gauss

We are given a single integer $d$, and we are told that two people independently computed triangular sums of the form $1 + 2 + dots + n$ and $1 + 2 + dots + m$, where $m n$. The only information we still have is the difference between these two sums, which equals $d$.

Practice › Codeforces Solutions › 2023-2024 ICPC, Swiss Subregional ›

CF 104854F - Factorial Prime

We are given a single integer $x$. Our task is to find the largest number $y$ that does not exceed $x$, with two properties at the same time. First, $y$ must be a prime number.

Practice › Codeforces Solutions › 2023-2024 ICPC, Swiss Subregional ›

CF 104854E - Elimination Bracket

We are given a string made of three possible characters: opening brackets, closing brackets, and wildcard symbols. Each wildcard can later be replaced independently by either an opening or a closing bracket.

Practice › Codeforces Solutions › 2023-2024 ICPC, Swiss Subregional ›

CF 104854D - District 42

We are given a single integer $n$, and we conceptually write down all positive integers from 1 up to $n$ one after another with no separators, forming one long digit string. For example, if $n = 15$, the string is 123456789101112131415.

Practice › Codeforces Solutions › 2023-2024 ICPC, Swiss Subregional ›

CF 104854A - Arthur The Ant

We are given a very large rectangular grid, but only a small number of special cells called lily pads are initially active. Two of these pads are always at the start cell and the target cell.

Practice › Codeforces Solutions › 2023-2024 ICPC, Swiss Subregional ›

CF 104854B - Beautiful Contest

We maintain a dynamic multiset of problems. Each problem has a difficulty value and a beauty value, and operations either insert or delete a specific problem instance. After every update, we are asked to compute the maximum possible total beauty of a valid “contest”.

Practice › Codeforces Solutions › 2023-2024 ICPC, Swiss Subregional ›

CF 104854C - Continued Fractions

We are given a large integer $p$. Each test case asks us to look at all factorizations $p = a cdot b$, where both $a$ and $b$ are positive integers.