2024 (ICPC) Jiangxi Provincial Contest -- Official Contest

12 problems from 2024 (ICPC) Jiangxi Provincial Contest -- Official Contest (contest 105231), difficulty -. 11/12 solutions verified against sample I/O.

12 items

2024 (ICPC) Jiangxi Provincial Contest -- Official Contest

ICPC/IOI | 12 problems | 11/12 verified | Difficulty - | 12m 59s

#	Problem	Time	✓
A	Maliang Learning Painting	2m 28s
B	Magic Leeks	1m 26s	✓
C	Liar	55s	✓
D	Magic LCM	52s	✓
E	Magic Subsequence	1m 10s	✓
F	The Ropeways	54s	✓
G	Multiples of 5	46s	✓
H	Convolution	56s	✓
I	Neuvillette Circling	58s	✓
J	Magic Mahjong	51s	✓
K	Magic Tree	48s	✓
L	Campus	55s	✓

Practice › Codeforces Solutions › 2024 (ICPC) Jiangxi Provincial Contest -- Official Contest ›

CF 105231A - Maliang Learning Painting

Codeforces 105231A: Maliang Learning Painting

Practice › Codeforces Solutions › 2024 (ICPC) Jiangxi Provincial Contest -- Official Contest ›

CF 105231B - Magic Leeks

We are given a one-dimensional field of leeks represented by an array. A worker starts at a fixed position and moves along this line for a fixed number of time steps. At every step, all leeks grow uniformly by the same amount.

Practice › Codeforces Solutions › 2024 (ICPC) Jiangxi Provincial Contest -- Official Contest ›

CF 105231L - Campus

We are given a weighted undirected graph representing a campus. Each node contains a number of tourists, and certain nodes are designated as gates. Each gate is only active during a specific time interval. Over time from 1 to T, the set of active gates changes.

Practice › Codeforces Solutions › 2024 (ICPC) Jiangxi Provincial Contest -- Official Contest ›

CF 105231K - Magic Tree

We are given a graph that is extremely simple in structure: a grid with 2 rows and $m$ columns. Each cell $(i, j)$ is a vertex, and edges exist only between orthogonally adjacent cells.

Practice › Codeforces Solutions › 2024 (ICPC) Jiangxi Provincial Contest -- Official Contest ›

CF 105231J - Magic Mahjong

We are given multiple independent hands of Mahjong, each consisting of 14 tiles encoded as a 28-character string. Each tile is written as a value plus a suit or honor marker, so every tile occupies exactly two characters in the input.

Practice › Codeforces Solutions › 2024 (ICPC) Jiangxi Provincial Contest -- Official Contest ›

CF 105231I - Neuvillette Circling

We are given a set of points in the plane, and we should think of every pair of points as being connected by a segment. Each such segment corresponds to one “enemy” that can appear at any position along that segment, but its exact location is not fixed in advance.

Practice › Codeforces Solutions › 2024 (ICPC) Jiangxi Provincial Contest -- Official Contest ›

CF 105231H - Convolution

We are given a large numeric grid, think of it as a matrix of values. We also fix the size of a smaller rectangular “filter” of size $k times l$.

Practice › Codeforces Solutions › 2024 (ICPC) Jiangxi Provincial Contest -- Official Contest ›

CF 105231G - Multiples of 5

We are given a very large integer written in base 11, but we never see it as a continuous string. Instead, the number is encoded as a sequence of blocks. Each block says “repeat digit d exactly k times”, and concatenating all blocks gives the full base-11 representation.

Practice › Codeforces Solutions › 2024 (ICPC) Jiangxi Provincial Contest -- Official Contest ›

CF 105231F - The Ropeways

We are given a tree of up to two hundred thousand nodes. Each edge is marked with a value 0 or 1, and over time these edge values can flip between broken and working. The structure of the tree itself never changes, only whether an edge is currently usable.

Practice › Codeforces Solutions › 2024 (ICPC) Jiangxi Provincial Contest -- Official Contest ›

CF 105231E - Magic Subsequence

We are given a sequence of positive integers and asked to construct two different subsets of indices such that the sum of values chosen by the first subset equals the sum of values chosen by the second subset.

Practice › Codeforces Solutions › 2024 (ICPC) Jiangxi Provincial Contest -- Official Contest ›

CF 105231D - Magic LCM

We are given a sequence of positive integers. We are allowed to repeatedly pick any two positions in the sequence and replace the pair using a deterministic transformation: one position becomes the gcd of the pair, the other becomes the lcm of the pair.

Practice › Codeforces Solutions › 2024 (ICPC) Jiangxi Provincial Contest -- Official Contest ›

CF 105231C - Liar

We are given a set of players, each of whom claims to own a certain integer value. However, these claims may or may not be true. The actual values assigned to all players must sum up to a fixed total $s$.