2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams)
14 problems from 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) (contest 2041), difficulty 1200-3300. 5/14 solutions verified against sample I/O.
2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams)
ICPC/IOI | 14 problems | 5/14 verified | Difficulty 1200-3300 | 26m
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | The Bento Box Adventure | 1300 | implementation, sortings | 11,288 | 1m 25s | ✓ |
| B | Bowling Frame | 1200 | binary-search, brute-force, math | 7,174 | 2m 6s | |
| C | Cube | 2000 | bitmasks, dfs-and-similar, dp | 2,011 | 1m 16s | ✓ |
| D | Drunken Maze | 1700 | brute-force, dfs-and-similar, graphs | 4,780 | 3m 24s | ✓ |
| E | Beautiful Array | 1200 | constructive-algorithms, math | 9,879 | 1m 50s | |
| F | Segmentation Folds | 2400 | brute-force, dfs-and-similar, number-theory | 508 | 1m 41s | |
| G | Grid Game | 3100 | 67 | 2m 16s | ||
| H | Sheet Music | 2300 | combinatorics, dp, math | 1,031 | 1m 43s | |
| I | Auto Complete | 2300 | binary-search, data-structures, hashing | 673 | 2m 10s | ✓ |
| J | Bottle Arrangement | 2700 | data-structures, divide-and-conquer, dp | 265 | 2m 2s | |
| K | Trophic Balance Species | 3100 | binary-search, brute-force, dfs-and-similar | 122 | 1m 4s | ✓ |
| L | Building Castle | 2900 | 70 | 1m 22s | ||
| M | Selection Sort | 2000 | binary-search, data-structures, greedy | 1,327 | 1m 40s | |
| N | Railway Construction | 3300 | 67 | 2m 1s |
CF 2041N - Railway Construction
The failure you show is not enough to diagnose the algorithm itself. Let's trace what happened: The input contains 5 test cases: The program produced only: instead of: This means the code successfully processed the first test case and then terminated before handling the…
CF 2041M - Selection Sort
We are given a single array of integers, and we want to transform it into a non-decreasing sequence. The only tool allowed is a special sorting routine that behaves like a selection-sort variant: it repeatedly compares a fixed position with all later positions and swaps…
CF 2041L - Building Castle
I can't provide a correct editorial for Codeforces 2041L from the problem statement alone because the key geometric optimization step is nontrivial, and I do not have enough information about the official solution to reconstruct a provably correct accepted algorithm.
CF 2041J - Bottle Arrangement
The failure you show is not enough to diagnose the algorithm itself. Let's trace what happened: The input contains 5 test cases: The program produced only: instead of: This means the code successfully processed the first test case and then terminated before handling the…
CF 2041I - Auto Complete
We are asked to simulate an advanced text editor that supports four operations: adding patterns for auto-complete, deleting patterns, appending text to the current editor content, and deleting characters from the end of the current content.
CF 2041K - Trophic Balance Species
We are given an ecosystem modeled as a directed graph, where each node represents a species and each directed edge represents a feeding relationship from prey to predator. For each species, we want to identify whether it is a trophic balance species.
CF 2041G - Grid Game
We have an enormous $n times n$ grid, where $n$ can be as large as $10^9$. Some cells are painted black by drawing vertical segments inside columns. Every cell covered by at least one segment becomes black.
CF 2041H - Sheet Music
Alice wants to count all sequences of notes of length n using pitches from 1 to k, but sequences that "move" the same way are considered identical.
CF 2041D - Drunken Maze
We have a rectangular maze represented as a grid of characters. Empty cells are walkable, walls block movement, and two special cells mark the start and target positions.
CF 2041F - Segmentation Folds
We are given a segment on the number line defined by two integers $ell$ and $r$, and Peter can fold this segment in two specific ways: from left to right (LTR) and from right to left (RTL).
CF 2041E - Beautiful Array
We are asked to construct an integer array such that its mean is exactly a and its median is exactly b. The input consists of two integers, a and b, which are the desired mean and median, respectively.
CF 2041B - Bowling Frame
The failure you show is not enough to diagnose the algorithm itself. Let's trace what happened: The input contains 5 test cases: The program produced only: instead of: This means the code successfully processed the first test case and then terminated before handling the…
CF 2041A - The Bento Box Adventure
The problem presents a scenario where a person visits one restaurant each day from Monday to Thursday, choosing a different restaurant each day from a set of five possible restaurants. The input gives the sequence of four distinct restaurants visited, one per day.
CF 2041C - Cube
We are given a cube of size $n times n times n$, where every cell contains a weight. The task is to pick exactly $n$ cells such that no two chosen cells share the same coordinate in any dimension.