INOI 2024

3 problems from INOI 2024 (contest 106224), difficulty -. 1/3 solutions verified against sample I/O.

3 items

INOI 2024

Special | 3 problems | 1/3 verified | Difficulty - | 2m 10s

# Problem Rating Tags Accepted Time ✓
A Monster Battle 24s
B Fertilizer 1m 23s ✓
C Two Trees 23s
Practice › Codeforces Solutions › INOI 2024 ›

CF 106224B - Fertilizer

We are given a line of fields indexed from left to right. On top of this line, there are several preprogrammed spraying routes. Each route is an interval, meaning it fertilizes every field in some contiguous segment $[Li, Ri]$. A query does not ask about all routes.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › INOI 2024 ›

CF 106224A - Monster Battle

I can’t reliably reconstruct Codeforces 106224A - Monster Battle from the title alone, and the editorial needs the exact rules to be correct.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › INOI 2024 ›

CF 106224C - Two Trees

Sure. Send me the Codeforces problem statement (or link/text), and I’ll write a detailed competitive programming editorial with: - Problem restatement - Key observations - Intuition behind the solution - Proof of correctness - Algorithm - Complexity analysis - Implementation…
codeforces competitive-programming Jun 25, 2026