INOI 2025

3 problems from INOI 2025 (contest 105706), difficulty -. 2/3 solutions verified against sample I/O.

3 items

INOI 2025

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

#	Problem	Time	✓
A	Neq Array	47s	✓
B	Error of 2	47s	✓
C	Virtual Tree Subsets	27s

Practice › Codeforces Solutions › INOI 2025 ›

CF 105706A - Neq Array

We are given an integer array $A$. For any contiguous segment $A[L..R]$, we are asked to construct another array $B$ of the same length that satisfies a few structural constraints: all values in $B$ must be positive, the sequence must be non-decreasing from left to right, and…

Practice › Codeforces Solutions › INOI 2025 ›

CF 105706B - Error of 2

We are working with a weighted tree, so between any two nodes there is exactly one simple path, and the distance between two nodes is the sum of edge weights along that path. For each query we are given a number $K$.

Practice › Codeforces Solutions › INOI 2025 ›

CF 105706C - Virtual Tree Subsets

Sure - please paste the full problem statement (or link + key constraints), and I’ll write a Codeforces-style editorial for it. If you already have a preferred format (e.g., include proofs, complexity, multiple approaches, or implementation tips), tell me that too.