2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred)
13 problems from 2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred) (contest 2045), difficulty 1400-3500. 4/13 solutions verified against sample I/O.
2024-2025 ICPC Asia Jakarta Regional Contest (Unrated, Online Mirror, ICPC Rules, Teams Preferred)
ICPC/IOI | 13 problems | 4/13 verified | Difficulty 1400-3500 | 26m 38s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Scrambled Scrabble | 1700 | brute-force, greedy | 2,568 | 1m 7s | ✓ |
| B | ICPC Square | 2000 | math, number-theory | 1,707 | 2m 33s | |
| C | Saraga | 1400 | greedy, strings | 7,210 | 1m 41s | |
| D | Aquatic Dragon | 3500 | 63 | 1m 59s | ||
| E | Narrower Passageway | 2700 | combinatorics, data-structures | 300 | 3m 33s | |
| F | Grid Game 3-angle | 3000 | games, math | 154 | 1m 48s | |
| G | X Aura | 2200 | graphs, math, shortest-paths | 935 | 1m 1s | ✓ |
| H | Missing Separators | 2200 | dp, sortings, string-suffix-structures | 795 | 1m 41s | |
| I | Microwavable Subsequence | 2100 | data-structures | 1,377 | 2m 56s | |
| J | Xorderable Array | 2600 | bitmasks, data-structures | 341 | 1m 9s | ✓ |
| K | GCDDCG | 2900 | 131 | 2m 3s | ||
| L | Buggy DFS | 3000 | constructive-algorithms | 160 | 3m 33s | |
| M | Mirror Maze | 1800 | brute-force, dfs-and-similar, graphs | 2,222 | 1m 34s | ✓ |
CF 2045L - Buggy DFS
We are asked to study a variation of Depth First Search (DFS) called Buggy DFS (BDFS). In BDFS, a standard DFS is implemented using an explicit stack, but with a subtle behavior: for every node u popped from the stack, the algorithm increments a counter for every neighbor of u…
CF 2045M - Mirror Maze
Think of the laser beam as moving along the grid lines between cells. Whenever the beam enters a cell through one side, the content of that cell determines which side it leaves from. An empty cell does not change direction.
CF 2045K - GCDDCG
We are given a deck of $N$ cards, each labeled with an integer value between $1$ and $N$. The game has $N$ rounds.
CF 2045I - Microwavable Subsequence
Thank you, now the problem is clear. The previous formula: does not always produce the optimal next floor because it computes the largest integer k ≤ (floor+D)//floor, but the next step may allow a smaller multiple of floor that lets a larger final floor later.
CF 2045J - Xorderable Array
We are given an array of values $A$, and another array $X$. The task is not to modify $A$ directly, but to ask a very specific question about pairs of values from $X$. For any ordered pair $(p, q)$, we are allowed to rearrange the array $A$.
CF 2045H - Missing Separators
We are given a single long string made by writing several unknown words one after another in alphabetical order and then removing all separators. The original structure is a dictionary: words are distinct and sorted lexicographically.
CF 2045E - Narrower Passageway
We are given a grid with two rows and $N$ columns. Each cell contains a value representing the strength of a soldier stationed there. On any given day, each column independently either disappears in fog or remains visible, with probability $1/2$.
CF 2045F - Grid Game 3-angle
We are given a triangular grid of size $N$, where row $r$ has $r$ cells. Certain cells initially contain some stones. Two players, Anda and Kamu, alternate turns, starting with Anda.
CF 2045G - X Aura
We are given a grid of size $R times C$ where each cell has a height from 0 to 9. You can move only between adjacent cells (up, down, left, right).
CF 2045D - Aquatic Dragon
We are asked to navigate a line of islands numbered from 1 to N, starting at island 1 and ending at island N, while carrying a dragon whose stamina powers two special moves: swimming and flying.
CF 2045B - ICPC Square
We are given a hotel with $N$ floors and an unusual elevator. From floor $x$, the elevator allows a jump to any floor $y$ such that $y$ is a multiple of $x$ and the difference $y - x$ does not exceed $D$.
CF 2045C - Saraga
We are given two strings, one called $S$ and another called $T$. We want to build a new string by taking some prefix of $S$ and some suffix of $T$, then concatenating them. The resulting string is called an abbreviation.
CF 2045A - Scrambled Scrabble
We are asked to construct the longest possible word from a given string of uppercase letters under a very specific notion of syllables and letters. The alphabet is split into vowels (A, E, I, O, U), consonants (all others except Y), and a special letter Y that can act as either.