Innopolis Open 2024. Qualification Round 1

5 problems from Innopolis Open 2024. Qualification Round 1 (contest 104789), difficulty -. 4/5 solutions verified against sample I/O.

5 items

Innopolis Open 2024. Qualification Round 1

Special | 5 problems | 4/5 verified | Difficulty - | 3m 42s

#	Problem	Time	✓
A	Fence Painting	29s
B	Work, Sleep, Repeat	43s	✓
C	Palindromization	49s	✓
D	Hackathon	50s	✓
E	Tree Trisection	51s	✓

Practice › Codeforces Solutions › Innopolis Open 2024. Qualification Round 1 ›

CF 104789C - Palindromization

We are given an array and allowed to apply operations that add a value to a contiguous segment. The goal is not to optimize the array directly, but to make it palindromic using the minimum number of such segment operations.

Practice › Codeforces Solutions › Innopolis Open 2024. Qualification Round 1 ›

CF 104789A - Fence Painting

The prompt is missing the most important part needed to write a correct editorial: the actual problem statement and the input/output specification. The text you provided is only the official editorial for the subtasks and full solution.

Practice › Codeforces Solutions › Innopolis Open 2024. Qualification Round 1 ›

CF 104789E - Tree Trisection

We are given a perfect binary tree whose leaves are numbered in the usual heap style, so the leftmost leaf is 1 and every internal node corresponds to a contiguous segment of leaves. Each query specifies a segment of leaves $[l, r]$.

Practice › Codeforces Solutions › Innopolis Open 2024. Qualification Round 1 ›

CF 104789D - Hackathon

The process in this problem can be seen as a dynamic race between people and positions on a line of pizza pieces.

Practice › Codeforces Solutions › Innopolis Open 2024. Qualification Round 1 ›

CF 104789B - Work, Sleep, Repeat

We are given a repeating schedule that alternates between work days and rest days. One full pattern consists of a block of x work days followed by y rest days, and then it repeats forever. This means the entire timeline is periodic with period x + y.