The 2022 ICPC Asia Xian Regional Contest

12 problems from The 2022 ICPC Asia Xian Regional Contest (contest 104077), difficulty -. 10/12 solutions verified against sample I/O.

12 items

The 2022 ICPC Asia Xian Regional Contest

ICPC/IOI | 12 problems | 10/12 verified | Difficulty - | 13m 31s

#	Problem	Time	✓
A	Bridge	42s
B	Cells Coloring	57s	✓
C	Clone Ranran	58s	✓
D	Contests	52s	✓
E	Find Maximum	1m 8s	✓
F	Hotel	2m 6s
G	Perfect Word	2m 43s	✓
H	Power of Two	49s	✓
I	Square Grid	46s	✓
J	Strange Sum	52s	✓
K	Streets	52s	✓
L	Tree	46s	✓

Practice › Codeforces Solutions › The 2022 ICPC Asia Xian Regional Contest ›

CF 104077G - Perfect Word

We are given a collection of strings. From this collection we want to build a new string, and we call it valid if every contiguous piece of it appears somewhere in the given collection as one of the input strings.

Practice › Codeforces Solutions › The 2022 ICPC Asia Xian Regional Contest ›

CF 104077L - Tree

We are given a rooted tree where node 1 is the root and every other node has a parent pointer, so the structure is fixed and acyclic. For each node, we can talk about its subtree, meaning all nodes whose path to the root passes through that node.

Practice › Codeforces Solutions › The 2022 ICPC Asia Xian Regional Contest ›

CF 104077K - Streets

We are working on a geometric selection problem defined on a grid that is not explicitly built, but implicitly formed by vertical and horizontal lines.

Practice › Codeforces Solutions › The 2022 ICPC Asia Xian Regional Contest ›

CF 104077J - Strange Sum

We are given an array of values, and we want to pick a subset of positions to maximize the sum of selected values. The twist is that selection is constrained in a non-uniform way: every chosen element imposes a restriction that depends on its index.

Practice › Codeforces Solutions › The 2022 ICPC Asia Xian Regional Contest ›

CF 104077I - Square Grid

We are working on a grid graph formed by lattice points from coordinates $(0,0)$ to $(n,n)$. Each point is connected to its four orthogonal neighbors whenever those neighbors stay inside the grid. A move is one step along one of these edges.

Practice › Codeforces Solutions › The 2022 ICPC Asia Xian Regional Contest ›

CF 104077F - Hotel

The Z-transform is defined recursively on binary strings with special behavior depending on whether the second argument is a block of zeros, identical to the first half, or a general concatenation case.

Practice › Codeforces Solutions › The 2022 ICPC Asia Xian Regional Contest ›

CF 104077H - Power of Two

We are given a multiset of numbers where each number is a power of two, meaning each value is of the form $2^{ci}$. Alongside these numbers, we are also given a fixed number of bitwise operators: some AND operations, some OR operations, and some XOR operations.

Practice › Codeforces Solutions › The 2022 ICPC Asia Xian Regional Contest ›

CF 104077D - Contests

We are given multiple complete rankings of the same set of contestants. Each contest produces a permutation of all contestants, so for any contest we can compare two contestants and decide which one ranks ahead of the other.

Practice › Codeforces Solutions › The 2022 ICPC Asia Xian Regional Contest ›

CF 104077E - Find Maximum

We are given a recursively defined function over non-negative integers. The function assigns a value to every integer starting from zero, where zero has a fixed value, and every positive number is computed from a smaller number.

Practice › Codeforces Solutions › The 2022 ICPC Asia Xian Regional Contest ›

CF 104077A - Bridge

Connection interrupted. Waiting for the complete answer

Practice › Codeforces Solutions › The 2022 ICPC Asia Xian Regional Contest ›

CF 104077C - Clone Ranran

We are simulating a contest preparation process that evolves over time. At the start there is a single worker, Ranran, and there is no work done yet. The goal is to reach a state where at least c problems have been prepared as quickly as possible.

Practice › Codeforces Solutions › The 2022 ICPC Asia Xian Regional Contest ›

CF 104077B - Cells Coloring

We are given a grid where each cell is either blocked or available. On the available cells we want to assign colors, but the coloring rule is restrictive: for every color other than 0, no two cells sharing the same row or the same column are allowed to have that color.