The 2021 ICPC Asia Shenyang Regional Contest

13 problems from The 2021 ICPC Asia Shenyang Regional Contest (contest 103427), difficulty -. 13/13 solutions verified against sample I/O.

13 items

The 2021 ICPC Asia Shenyang Regional Contest

ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 11m 43s

#	Problem	Time	✓
A	A Bite of Teyvat	1m 3s	✓
B	Bitwise Exclusive-OR Sequence	49s	✓
C	Cards of Magic	1m	✓
D	Cross the Maze	52s	✓
E	Edward Gaming, the Champion	57s	✓
F	Encoded Strings I	43s	✓
G	Encoded Strings II	50s	✓
H	Line Graph Matching	48s	✓
I	Linear Fractional Transformation	49s	✓
J	Luggage Lock	49s	✓
K	Matrix Operations	1m 13s	✓
L	Perfect Matchings	1m 4s	✓
M	String Problem	46s	✓

Practice › Codeforces Solutions › The 2021 ICPC Asia Shenyang Regional Contest ›

CF 103427B - Bitwise Exclusive-OR Sequence

We are given a sequence of unknown nonnegative integers $a1, a2, dots, an$. Instead of the values themselves, we receive a set of constraints of the form that the XOR of two positions is fixed: $au oplus av = w$.

Practice › Codeforces Solutions › The 2021 ICPC Asia Shenyang Regional Contest ›

CF 103427E - Edward Gaming, the Champion

We are given a single lowercase string and asked to count how many times a specific pattern, namely the string "edgnb", appears as a contiguous substring.

Practice › Codeforces Solutions › The 2021 ICPC Asia Shenyang Regional Contest ›

CF 103427M - String Problem

We are given a single lowercase string. For every prefix of this string, we need to look at all possible contiguous substrings inside that prefix and pick the lexicographically largest one.

Practice › Codeforces Solutions › The 2021 ICPC Asia Shenyang Regional Contest ›

CF 103427L - Perfect Matchings

We start with a complete graph on $2n$ vertices, so every pair of vertices is initially connected. Then we are given a set of $2n-1$ edges that form a tree, and those edges are removed.

Practice › Codeforces Solutions › The 2021 ICPC Asia Shenyang Regional Contest ›

CF 103427K - Matrix Operations

We are working with an initially empty square grid of size $n times n$, where every cell starts at zero. Then we process exactly $n$ operations.

Practice › Codeforces Solutions › The 2021 ICPC Asia Shenyang Regional Contest ›

CF 103427J - Luggage Lock

We are given a 4-digit lock. Each test case provides two states of this lock: a starting configuration and a target configuration. Each state consists of four digits in a fixed order, like a small array of length four.

Practice › Codeforces Solutions › The 2021 ICPC Asia Shenyang Regional Contest ›

CF 103427I - Linear Fractional Transformation

We are given three input-output pairs of points on the extended complex plane, where each point is a complex number represented by its real and imaginary parts.

Practice › Codeforces Solutions › The 2021 ICPC Asia Shenyang Regional Contest ›

CF 103427H - Line Graph Matching

We start with a connected undirected graph where each edge has a weight. From this graph, we construct another graph called the line graph. In this transformed graph, every original edge becomes a vertex.

Practice › Codeforces Solutions › The 2021 ICPC Asia Shenyang Regional Contest ›

CF 103427G - Encoded Strings II

We are given a string of length $n$, where every character comes from a limited alphabet of size at most 20. From this string, we consider every nonempty subsequence.

Practice › Codeforces Solutions › The 2021 ICPC Asia Shenyang Regional Contest ›

CF 103427F - Encoded Strings I

We are given a string of length $n$, and we look at every non-empty prefix of this string. For each prefix, we apply a deterministic transformation that depends on the positions of characters inside that prefix. The transformation works as follows.

Practice › Codeforces Solutions › The 2021 ICPC Asia Shenyang Regional Contest ›

CF 103427D - Cross the Maze

We are given a small grid maze with dimensions up to 100 by 100, and inside this grid there are exactly n adventurers and n escape ropes. Each adventurer starts at a unique cell, and each rope is also placed at a unique cell.

Practice › Codeforces Solutions › The 2021 ICPC Asia Shenyang Regional Contest ›

CF 103427C - Cards of Magic

We are simulating a turn-based fight where a monster starts with a given amount of health, and each turn you receive exactly one random card. The card is uniformly chosen among three types.

Practice › Codeforces Solutions › The 2021 ICPC Asia Shenyang Regional Contest ›

CF 103427A - A Bite of Teyvat

We are given a sequence of circles placed one by one on a horizontal line. Each circle is fully determined by its center position on the x-axis and its radius, so every circle lies in the plane with center at $(xi, 0)$ and radius $ri$.