The 2024 ICPC Kunming Invitational Contest

13 problems from The 2024 ICPC Kunming Invitational Contest (contest 105386), difficulty -. 13/13 solutions verified against sample I/O.

13 items

The 2024 ICPC Kunming Invitational Contest

ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 14m 3s

#	Problem	Time	✓
A	Two-star Contest	1m 10s	✓
B	Gold Medal	1m 32s	✓
C	Stop the Castle 2	1m 8s	✓
D	Generated String	1m 19s	✓
E	Relearn through Review	59s	✓
F	Collect the Coins	51s	✓
G	Be Positive	58s	✓
H	Subarray	1m	✓
I	Left Shifting 2	56s	✓
J	The Quest for El Dorado	52s	✓
K	Permutation	1m 20s	✓
L	Trails	58s	✓
M	Italian Cuisine	1m	✓

Practice › Codeforces Solutions › The 2024 ICPC Kunming Invitational Contest ›

CF 105386K - Permutation

We are given a hidden permutation p of length n, meaning each number from 1 to n appears exactly once, but we do not know the order. We can ask queries. Each query is another length-n array q, where each entry is also between 1 and n.

Practice › Codeforces Solutions › The 2024 ICPC Kunming Invitational Contest ›

CF 105386L - Trails

We are working on an infinite grid of integer points. From every lattice point, you can move one step right or one step up for free, because there are standard unit edges in those directions.

Practice › Codeforces Solutions › The 2024 ICPC Kunming Invitational Contest ›

CF 105386H - Subarray

We are given an array of integers and we look at all possible contiguous subarrays. For any fixed subarray, we focus on its maximum value and we also count how many times that maximum value appears inside the subarray.

Practice › Codeforces Solutions › The 2024 ICPC Kunming Invitational Contest ›

CF 105386B - Gold Medal

There are several contests running in parallel. Each contest already has some number of participating teams, and you are allowed to distribute an additional pool of teams across these contests however you want.

Practice › Codeforces Solutions › The 2024 ICPC Kunming Invitational Contest ›

CF 105386D - Generated String

We start with a fixed base string $S$. Every operation builds new strings by cutting several substrings from $S$ and concatenating them in order.

Practice › Codeforces Solutions › The 2024 ICPC Kunming Invitational Contest ›

CF 105386E - Relearn through Review

We are given an integer array and a single operation that can be applied at most once. The operation picks a contiguous segment and adds a fixed value $k$ to every element in that segment.

Practice › Codeforces Solutions › The 2024 ICPC Kunming Invitational Contest ›

CF 105386M - Italian Cuisine

We are given a convex polygon representing a pizza, and a circular region inside it representing a pineapple topping.

Practice › Codeforces Solutions › The 2024 ICPC Kunming Invitational Contest ›

CF 105386J - The Quest for El Dorado

We are given a graph of cities connected by undirected roads, where each road belongs to a company and has a length. The structure is fixed, but movement is constrained by a sequence of tickets that must be used in order.

Practice › Codeforces Solutions › The 2024 ICPC Kunming Invitational Contest ›

CF 105386I - Left Shifting 2

We are given a string and we are allowed to cyclically shift it. After choosing a shift, we look at the resulting string arranged in a circle, meaning the last character is considered adjacent to the first.

Practice › Codeforces Solutions › The 2024 ICPC Kunming Invitational Contest ›

CF 105386G - Be Positive

We are asked to build a permutation of numbers from 0 to n minus 1 such that when we read it from left to right, the XOR of every prefix is strictly positive.

Practice › Codeforces Solutions › The 2024 ICPC Kunming Invitational Contest ›

CF 105386F - Collect the Coins

We are given a sequence of events on a number line of integer cells. Each event is a coin that appears at a specific time and position, and it exists for exactly one second.

Practice › Codeforces Solutions › The 2024 ICPC Kunming Invitational Contest ›

CF 105386A - Two-star Contest

We are given several contests. Each contest has a “star rating” and a vector of properties. The score of a contest is simply the sum of all its properties. Some property values are already fixed, while others are missing and marked as unknown.

Practice › Codeforces Solutions › The 2024 ICPC Kunming Invitational Contest ›

CF 105386C - Stop the Castle 2

We are working on a very large grid, but only a sparse set of cells are relevant: some cells contain castles and some contain obstacles. Two castles can “see” each other if they lie in the same row or column and nothing important lies strictly between them.