2023 (ICPC) Jiangxi Provincial Contest -- Official Contest

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

12 items

2023 (ICPC) Jiangxi Provincial Contest -- Official Contest

ICPC/IOI | 12 problems | 12/12 verified | Difficulty - | 12m 36s

#	Problem	Time	✓
A	Drill Wood to Make Fire	40s	✓
B	Wonderful Array	2m 6s	✓
C	Battle	48s	✓
D	Stack Out	58s	✓
E	Segment-tree	58s	✓
F	Cities	1m 1s	✓
G	Copy and Paste	52s	✓
H	Permutation	1m 58s	✓
I	Tree	54s	✓
J	Function	56s	✓
K	Split	48s	✓
L	Zhang Fei Threading Needles - Thick with Fine	37s	✓

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

CF 104385K - Split

We are given a sequence that starts out sorted in non-increasing order. The sequence is dynamic, because we are allowed to perform point updates of a very specific form, and we must also answer queries about how best to split the array into contiguous segments.

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

CF 104385L - Zhang Fei Threading Needles - Thick with Fine

We are given a single integer $N$, representing the number of soldiers in Cao Cao’s army positioned in front of Changban Bridge. The story describes Zhang Fei’s roar causing panic and making soldiers flee.

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

CF 104385H - Permutation

The crash happens before any algorithm runs: Your program is assuming a multi-line format with three integers in the first line, but the actual input is: So: - First line contains only N - Second line contains the array - There are no M, Q, or query lines at all This is not a…

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

CF 104385J - Function

We are maintaining a dynamic collection of quadratic functions, all sharing the same shape but shifted along the x-axis and vertically offset. Each function looks like a parabola with fixed curvature 1, centered at some integer position, and then shifted up by a constant value.

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

CF 104385I - Tree

We are given a tree where each edge carries an integer value. The tree is fixed, but the edge values change over time. The system supports two operations.

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

CF 104385F - Cities

We are given a line of cities labeled from 1 to n, each placed at a distinct coordinate on a number line. Adjacent cities are connected by a road, so initially the graph is just a chain.

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

CF 104385G - Copy and Paste

We are given a target lowercase string and an initially empty workspace. The goal is to construct the string using the fewest possible operations under a very specific toolset: we can append a single character to the end of the current text, we can copy the entire current text…

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

CF 104385B - Wonderful Array

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

CF 104385E - Segment-tree

We are given a complete segment tree over the range from 0 to 2^n − 1. Instead of working with the array directly, the problem constructs an induced graph G by running a segment tree query procedure on an interval [L, R].

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

CF 104385D - Stack Out

We are generating sequences of operations on a stack that processes the numbers from 1 to n in increasing order. At any moment, we either take the next unused number and push it onto the stack, or we pop the current top of the stack if it is not empty.

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

CF 104385C - Battle

We are given several piles of stones. Two players take turns, and on each turn a player selects exactly one pile and removes a number of stones from it.

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

CF 104385A - Drill Wood to Make Fire

We are given a very small simulation repeated multiple times. Each test case describes a scenario where a person is trying to generate fire by drilling wood.