HPI 2024 Advanced

12 problems from HPI 2024 Advanced (contest 105022), difficulty -. 2/12 solutions verified against sample I/O.

12 items

HPI 2024 Advanced

Special | 12 problems | 2/12 verified | Difficulty - | 17m 28s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Truck-Kun				1m 18s
B	Twin Trucks				1m 3s	✓
C	Car Go or Not Car Go				1m 27s	✓
D	Air Taxi Game				1m 27s
E	Distressed Driver				1m 19s
F	Sparkle's Stage				1m 26s
G	Just Visiting Relatives				1m 36s
H	One Step Closer To The AK				1m 36s
I	Find Iron Bundle				2m
J	Not So Generous Genie				1m 14s
K	Turning Trucks				1m 21s
L	Silver Wolf and IPC (Advanced)				1m 41s

Practice › Codeforces Solutions › HPI 2024 Advanced ›

CF 105022L - Silver Wolf and IPC (Advanced)

We are given a permutation of size $N$. Then we are given a sequence of $Q$ operations, each operation taking a segment $[l, r]$ and rotating it cyclically to the right by one position. After all $Q$ operations are applied, we obtain a final permutation.

Practice › Codeforces Solutions › HPI 2024 Advanced ›

CF 105022K - Turning Trucks

We are given a vertical stack of trucks, each truck contributing a fixed length segment. Initially, the stack is perfectly aligned on the y-axis starting from the origin, so the head of the top truck ends up at a point whose y-coordinate is the sum of all truck lengths and…

Practice › Codeforces Solutions › HPI 2024 Advanced ›

CF 105022J - Not So Generous Genie

We are given a string consisting only of digits 1 and 2, and we are allowed to modify it using a limited budget of coins.

Practice › Codeforces Solutions › HPI 2024 Advanced ›

CF 105022I - Find Iron Bundle

We are given a tree representing a metro network where every station is connected and there is exactly one simple path between any two stations. Two people matter: Psyduck, who starts at a uniformly chosen station, and Iron Bundle, who is located at some station.

Practice › Codeforces Solutions › HPI 2024 Advanced ›

CF 105022H - One Step Closer To The AK

We are given a binary array that changes over time through two kinds of operations. One operation flips every value in a range, turning zeros into ones and ones into zeros. The other operation asks us to look at a subarray and play a deterministic removal game on it.

Practice › Codeforces Solutions › HPI 2024 Advanced ›

CF 105022G - Just Visiting Relatives

We are given two length-N sequences, and we use them to define an N by N matrix where every entry is formed by multiplying a row weight from the first sequence with a column weight from the second sequence.

Practice › Codeforces Solutions › HPI 2024 Advanced ›

CF 105022F - Sparkle's Stage

We are given a set of trucks placed on a number line, each with a starting position and a constant velocity. Every truck moves in a straight line, and whenever two trucks meet at the same point at the same time, they collide.

Practice › Codeforces Solutions › HPI 2024 Advanced ›

CF 105022E - Distressed Driver

We are given a sequence of scheduled trips, each with a start time and an end time. Chad performs these trips in the given order. The key mechanic is that if a trip starts while he is still busy finishing a previous delayed trip, it does not start on its original time.

Practice › Codeforces Solutions › HPI 2024 Advanced ›

CF 105022D - Air Taxi Game

We are given several independent test cases. In each test case, there is a list of distinct positive integers representing city populations.

Practice › Codeforces Solutions › HPI 2024 Advanced ›

CF 105022C - Car Go or Not Car Go

We are looking at a deterministic process on a directed graph where every city has exactly one outgoing edge defined by doubling the index modulo $N$. Starting from city $1$, the car repeatedly follows this rule, producing a sequence of visited cities.

Practice › Codeforces Solutions › HPI 2024 Advanced ›

CF 105022A - Truck-Kun

We are given a complete directed graph on up to 300 vertices, where every ordered pair of vertices has a weight, which can be positive, zero, or negative.

Practice › Codeforces Solutions › HPI 2024 Advanced ›

CF 105022B - Twin Trucks

We are given a list of distinct truck lengths. From all possible pairs of different trucks, we assign a score based on two values: the sum of the lengths and the absolute difference between them.