Hunan University 2023 the 19th Programming Contest

12 problems from Hunan University 2023 the 19th Programming Contest (contest 104400), difficulty -. 12/12 solutions verified against sample I/O.

12 items

Hunan University 2023 the 19th Programming Contest

Special | 12 problems | 12/12 verified | Difficulty - | 11m 18s

#	Problem	Time	✓
A	Playf and ABC	52s	✓
B	Color	1m 29s	✓
C	Construct A Permutation	47s	✓
D	Sakuyalove and Fast FFT	48s	✓
E	stone(easy version)	47s	✓
F	stone(hard version)	1m 12s	✓
G	XOR Segments	50s	✓
H	Contest Simulation	1m 2s	✓
I	Infinite recurring Decimal	41s	✓
J	Sakuyalove and Latin Square	1m 1s	✓
K	The Demon Jester	1m 2s	✓
L	Timetable Queries	47s	✓

Practice › Codeforces Solutions › Hunan University 2023 the 19th Programming Contest ›

CF 104400H - Contest Simulation

We are given a programming contest log and need to reconstruct the final ranking of participants under ICPC-like rules, then print the ranking with medal separators. Each participant has a stream of submissions across up to 20 problems.

Practice › Codeforces Solutions › Hunan University 2023 the 19th Programming Contest ›

CF 104400A - Playf and ABC

We are given a string consisting only of the characters A, B, and C. From this string, we want to extract as many disjoint triples of indices as possible.

Practice › Codeforces Solutions › Hunan University 2023 the 19th Programming Contest ›

CF 104400L - Timetable Queries

We are given a one-day timetable of length n, where each minute has exactly one bus arriving and each arrival is labeled with a bus number. So the input array is a sequence of identifiers, and the i-th value tells us which bus arrives at minute i.

Practice › Codeforces Solutions › Hunan University 2023 the 19th Programming Contest ›

CF 104400K - The Demon Jester

We are working on a tree where one player, Malphite, starts fixed at vertex 1 and continuously moves along shortest paths trying to reach a moving target controlled by Playf.

Practice › Codeforces Solutions › Hunan University 2023 the 19th Programming Contest ›

CF 104400J - Sakuyalove and Latin Square

We are given a partially filled Latin square of size $n times n$. A Latin square is a grid where every row contains each number from $1$ to $n$ exactly once, and every column also contains each number from $1$ to $n$ exactly once.

Practice › Codeforces Solutions › Hunan University 2023 the 19th Programming Contest ›

CF 104400I - Infinite recurring Decimal

We are given a positive integer $n$ that is guaranteed not to be divisible by 2 or 5. This condition ensures that the decimal expansion of $frac{1}{n}$ is purely repeating after the decimal point, with no terminating prefix.

Practice › Codeforces Solutions › Hunan University 2023 the 19th Programming Contest ›

CF 104400G - XOR Segments

We are asked to count how many arrays of length $n$ exist where each element is an integer in $[0, 2^k)$, while also satisfying a set of XOR constraints on subsegments. Each constraint fixes the XOR of a contiguous interval $[li, ri]$ to a given value $xi$.

Practice › Codeforces Solutions › Hunan University 2023 the 19th Programming Contest ›

CF 104400F - stone(hard version)

We are given a row of stone piles. Players alternate turns, starting with Alice. On a single turn, a player performs a sequence of up to $k$ consecutive moves. Each move removes at least one stone from the current leftmost non-empty pile.

Practice › Codeforces Solutions › Hunan University 2023 the 19th Programming Contest ›

CF 104400E - stone(easy version)

We are given a row of stone piles. The game proceeds in alternating turns starting with Alice. On each turn, the current player focuses only on the leftmost pile that still contains stones and removes at least one stone from it.

Practice › Codeforces Solutions › Hunan University 2023 the 19th Programming Contest ›

CF 104400D - Sakuyalove and Fast FFT

We are given an array of length $n+1$, indexed from $0$ to $n$. From this array, two new arrays are constructed through a layered transformation that mixes factorial terms and alternating signs.

Practice › Codeforces Solutions › Hunan University 2023 the 19th Programming Contest ›

CF 104400B - Color

We are given a sequence of colored objects arranged in a line, where each color is represented by an integer. The goal is to transform this sequence into a non-decreasing sequence using a special type of operation.

Practice › Codeforces Solutions › Hunan University 2023 the 19th Programming Contest ›

CF 104400C - Construct A Permutation

We are asked to construct a permutation of numbers from 1 to n that maximizes a nested alternating absolute expression of the form where differences are repeatedly taken between consecutive elements with absolute value applied at each subtraction level.