2023-2024 ICPC, Asia Yokohama Regional Contest 2023

11 problems from 2023-2024 ICPC, Asia Yokohama Regional Contest 2023 (contest 104832), difficulty -. 11/11 solutions verified against sample I/O.

11 items

2023-2024 ICPC, Asia Yokohama Regional Contest 2023

ICPC/IOI | 11 problems | 11/11 verified | Difficulty - | 11m 50s

#	Problem	Time	✓
A	Yokohama Phenomena	49s	✓
B	Rank Promotion	1m 5s	✓
C	Ferris Wheel	1m 5s	✓
D	Nested Repetition Compression	1m 3s	✓
E	Chayas	1m 12s	✓
F	Color Inversion on a Huge Chessboard	49s	✓
G	Fortune Telling	1m 11s	✓
H	Task Assignment to Two Employees	1m 31s	✓
I	Liquid Distribution	56s	✓
J	Do It Yourself?	1m 18s	✓
K	Probing the Disk	51s	✓

Practice › Codeforces Solutions › 2023-2024 ICPC, Asia Yokohama Regional Contest 2023 ›

CF 104832J - Do It Yourself?

We are given a company hierarchy that forms a rooted tree. Employee 1 is the root, and every other employee has exactly one direct boss whose ID is smaller, which guarantees that all edges point from a node to a smaller-index parent and the structure is a tree rooted at 1.

Practice › Codeforces Solutions › 2023-2024 ICPC, Asia Yokohama Regional Contest 2023 ›

CF 104832K - Probing the Disk

We are interacting with a hidden geometric object: a circle placed somewhere inside a very large square grid. The square spans coordinates from 0 to 100000 on both axes, and the circle has integer center coordinates and an integer radius.

Practice › Codeforces Solutions › 2023-2024 ICPC, Asia Yokohama Regional Contest 2023 ›

CF 104832H - Task Assignment to Two Employees

We are given a collection of tasks and two employees who will execute them. Each employee starts with the same initial skill value.

Practice › Codeforces Solutions › 2023-2024 ICPC, Asia Yokohama Regional Contest 2023 ›

CF 104832I - Liquid Distribution

We are given a collection of source containers, each containing a mixture of two liquids A and B in fixed proportions. From each container, we are allowed to take any fraction of its contents, and that fraction always preserves the original ratio of A to B inside that container.

Practice › Codeforces Solutions › 2023-2024 ICPC, Asia Yokohama Regional Contest 2023 ›

CF 104832G - Fortune Telling

We are given a line of $n$ tarot cards indexed from left to right. A random process repeatedly reduces this line until only one card remains. Each round, a fair six-sided die is rolled. Suppose it shows $x in {1,dots,6}$.

Practice › Codeforces Solutions › 2023-2024 ICPC, Asia Yokohama Regional Contest 2023 ›

CF 104832E - Chayas

We are given a set of labeled chayas placed along a straight line. The exact order is unknown, and we want to count how many full left-to-right permutations of these chayas are consistent with a list of historical observations.

Practice › Codeforces Solutions › 2023-2024 ICPC, Asia Yokohama Regional Contest 2023 ›

CF 104832F - Color Inversion on a Huge Chessboard

We are given an $n times n$ grid that starts in a fixed checkerboard pattern. A cell $(i, j)$ is initially black if $i + j$ is odd and white otherwise. Then we repeatedly apply operations that flip entire rows or entire columns. A flip means every cell in that line changes color.

Practice › Codeforces Solutions › 2023-2024 ICPC, Asia Yokohama Regional Contest 2023 ›

CF 104832D - Nested Repetition Compression

We are given a single string made of lowercase letters, and we want to rewrite it in a compressed form that is defined by a small grammar.

Practice › Codeforces Solutions › 2023-2024 ICPC, Asia Yokohama Regional Contest 2023 ›

CF 104832B - Rank Promotion

We are given a stream of quiz results for a single player, where each result is either correct or incorrect. The player starts at rank zero, and ranks can only increase. The rule for increasing rank is based on looking backward at the most recent portion of the history.

Practice › Codeforces Solutions › 2023-2024 ICPC, Asia Yokohama Regional Contest 2023 ›

CF 104832C - Ferris Wheel

We place $2n$ gondolas on a circle. Each gondola must be assigned one of $k$ colors. After coloring, we try to connect gondolas in pairs, with two constraints: every gondola is matched with exactly one other gondola of the same color, and the drawn segments representing these…

Practice › Codeforces Solutions › 2023-2024 ICPC, Asia Yokohama Regional Contest 2023 ›

CF 104832A - Yokohama Phenomena

We are given a small rectangular grid, where each cell contains one of six letters: Y, O, K, O, H, A, M, A. From this grid we want to count how many ways we can trace a specific fixed word of length eight: Y followed by O, K, O, H, A, M, A.