2024 HNMU@XTU

11 problems from 2024 HNMU@XTU (contest 105104), difficulty -. 11/11 solutions verified against sample I/O.

11 items

2024 HNMU@XTU

Special | 11 problems | 11/11 verified | Difficulty - | 9m 50s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Average of Intervals				55s	✓
B	Bigger, Bigger, Bigger				1m 3s	✓
C	Calculation of Intervals				49s	✓
D	$\text{DAY}^{-1}$				43s	✓
E	Election				48s	✓
F	4 Rectangles and 1 Square				58s	✓
G	Grading Papers				47s	✓
H	HNOI2010				53s	✓
I	Intervals				55s	✓
J	Journey on the Number Line				1m 7s	✓
K	Kitchen				52s	✓

Practice › Codeforces Solutions › 2024 HNMU@XTU ›

CF 105104K - Kitchen

We start with a collection of existing “deliciousness values” for pig’s trotter rice dishes. These values form an array, and once sorted, we define the instability of the menu as the largest gap between consecutive values in that sorted order.

Practice › Codeforces Solutions › 2024 HNMU@XTU ›

CF 105104J - Journey on the Number Line

We are given several test cases. Each test case describes a set of points placed on a line. Every point has a coordinate and an additional value attached to it. We are required to construct a route that starts at point 1, ends at point n, and visits every point exactly once.

Practice › Codeforces Solutions › 2024 HNMU@XTU ›

CF 105104I - Intervals

We are given several test cases, each containing a permutation of the numbers from 0 to n − 1. For any contiguous segment of this permutation, we look at the smallest non-negative integer that does not appear inside that segment, which is the mex of the segment.

Practice › Codeforces Solutions › 2024 HNMU@XTU ›

CF 105104H - HNOI2010

We are given a collection of intervals, each interval being a segment on the number line defined by two integers $xi le yi$.

Practice › Codeforces Solutions › 2024 HNMU@XTU ›

CF 105104G - Grading Papers

We are given a collection of strings indexed from 1 to n. These strings form a fixed ordered book, but they are not truly static because individual characters inside any string can be modified during the process. Alongside these strings, we process a sequence of operations.

Practice › Codeforces Solutions › 2024 HNMU@XTU ›

CF 105104F - 4 Rectangles and 1 Square

We are given four axis-aligned rectangles for each test case. Each rectangle can be rotated, meaning we are free to swap its sides.

Practice › Codeforces Solutions › 2024 HNMU@XTU ›

CF 105104E - Election

We are given a list of constituencies, each described only by a single integer representing how many votes it contains.

Practice › Codeforces Solutions › 2024 HNMU@XTU ›

CF 105104D - $\text{DAY}^{-1}$

We are given a fixed pattern string that is formed by repeating the block "xtu" exactly n times. So the full string p has length 3n and consists of a very rigid periodic structure: every three characters are always x, then t, then u.

Practice › Codeforces Solutions › 2024 HNMU@XTU ›

CF 105104B - Bigger, Bigger, Bigger

We start with two numbers, x and y. Each operation allows us to “pump” one of them: if we choose the first operation, x grows multiplicatively by a factor k and y gets a fixed additive boost d. If we choose the second operation, roles are reversed.

Practice › Codeforces Solutions › 2024 HNMU@XTU ›

CF 105104A - Average of Intervals

We are given an array of integers for each test case, and we are allowed to select several intervals that do not overlap. Each chosen interval contributes its sum to a global total, and we also count how many intervals we selected.

Practice › Codeforces Solutions › 2024 HNMU@XTU ›

CF 105104C - Calculation of Intervals

We are given an array for each test case and we need to count how many subarrays satisfy a specific parity condition: inside the chosen subarray, at least one value appears an odd number of times.