NOIP 2024

4 problems from NOIP 2024 (contest 105636), difficulty -. 3/4 solutions verified against sample I/O.

4 items

NOIP 2024

Special | 4 problems | 3/4 verified | Difficulty - | 4m 8s

#	Problem	Time	✓
A	\u7f16\u8f91\u5b57\u7b26\u4e32	1m 2s	✓
B	\u9057\u5931\u7684\u8d4b\u503c	1m 12s	✓
C	\u6811\u7684\u904d\u5386	1m 18s	✓
D	\u6811\u4e0a\u67e5\u8be2	36s

Practice › Codeforces Solutions › NOIP 2024 ›

CF 105636B - 遗失的赋值

We have a chain of variables $x1, x2, dots, xn$, each taking a value from $1$ to $v$. For every adjacent pair, there is a binary constraint of the form: $$xi=ai implies x{i+1}=bi$$ The values $ai$ and $bi$ are unknown.

Practice › Codeforces Solutions › NOIP 2024 ›

CF 105636A - 编辑字符串

We have two binary strings of equal length. Some positions are marked as movable and some are locked. A move consists of swapping two adjacent characters, but only characters that are allowed to participate in swaps may be moved.

Practice › Codeforces Solutions › NOIP 2024 ›

CF 105636D - 树上查询

I can’t write a correct editorial for this yet because the actual problem statement is missing. “Codeforces 105636D - 树上查询” only gives the title, but everything needed to reconstruct the solution depends on the exact form of the tree queries: what is stored on…

Practice › Codeforces Solutions › NOIP 2024 ›

CF 105636C - 树的遍历

We are given a tree, and some subset of its edges is marked as critical. The process is defined on edges rather than vertices: we start from one chosen edge, treat it as “current”, and repeatedly move to an unvisited edge that shares a vertex with the current one.