|
|
696 |
P1676G White-Black Balanced Subtrees
|
0 / 0 |
普及+/提高 |
|
|
673 |
P1680F Lenient Vertex Cover
|
0 / 0 |
10 |
|
|
667 |
P1681F Unique Occurrences
|
0 / 0 |
8 |
|
|
663 |
P1682D Circular Spanning Tree
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
662 |
P1682E Unordered Swaps
|
0 / 0 |
10 |
|
|
633 |
P1689C Infected Tree
|
0 / 0 |
提高+/省选- |
|
|
618 |
P1691F K-Set Tree
|
0 / 0 |
9 |
|
|
608 |
P1693B Fake Plastic Trees
|
0 / 0 |
提高+/省选- |
|
|
598 |
P1695D1 Tree Queries (Easy Version)
|
0 / 0 |
8 |
|
|
597 |
P1695D2 Tree Queries (Hard Version)
|
0 / 0 |
8 |
|
|
590 |
P1696F Tree Recovery
|
0 / 0 |
10 |
|
|
577 |
P1698E PermutationForces II
|
0 / 0 |
8 |
|
|
551 |
P1702G1 Passable Paths (easy version)
|
0 / 0 |
省选/NOI- |
|
|
550 |
P1702G2 Passable Paths (hard version)
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
513 |
P1706E Qpwoeirut and Vertices
|
0 / 0 |
8 |
|
|
510 |
P1707C DFS Trees
|
0 / 0 |
9 |
|
|
509 |
P1707D Partial Virtual Trees
|
0 / 0 |
10 |
|
|
500 |
P1709E XOR Tree
|
0 / 0 |
9 |
|
|
499 |
P1709F Multiset of Strings
|
0 / 0 |
9 |
|
|
495 |
P1710D Recover the Tree
|
0 / 0 |
10 |
|
|
485 |
P1712F Triameter
|
0 / 0 |
10 |
|
|
473 |
P1714F Build a Tree and That Is It
|
0 / 0 |
省选/NOI- |
|
|
472 |
P1714G Path Prefixes
|
0 / 0 |
提高+/省选- |
|
|
449 |
P1718D Permutation for Burenka
|
0 / 0 |
10 |
|
|
440 |
P1720D1 Xor-Subsequence (easy version)
|
0 / 0 |
省选/NOI- |
|
|
439 |
P1720D2 Xor-Subsequence (hard version)
|
0 / 0 |
9 |
|
|
433 |
P1721E Prefix Function Queries
|
0 / 0 |
8 |
|
|
420 |
P1725E Electrical Efficiency
|
0 / 0 |
9 |
|
|
416 |
P1725I Imitating the Key Tree
|
0 / 0 |
10 |
|
|
415 |
P1725J Journey
|
0 / 0 |
9 |
|
|
408 |
P1726D Edge Split
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
336 |
P1738D Permutation Addicts
|
0 / 0 |
省选/NOI- |
|
|
334 |
P1738F Connectivity Addicts
|
0 / 0 |
9 |
|
|
328 |
P1739D Reset K Edges
|
0 / 0 |
省选/NOI- |
|
|
321 |
P1740E Hanging Hearts
|
0 / 0 |
省选/NOI- |
|
|
318 |
P1740H MEX Tree Manipulation
|
0 / 0 |
10 |
|
|
313 |
P1741D Masha and a Beautiful Tree
|
0 / 0 |
普及+/提高 |
|
|
285 |
P1746D Paths on the Tree
|
0 / 0 |
省选/NOI- |
|
|
271 |
P1748E Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
|
264 |
P1749F Distance to the Path
|
0 / 0 |
10 |
|
|
222 |
P1761E Make It Connected
|
0 / 0 |
9 |
|
|
219 |
P1761G Centroid Guess
|
0 / 0 |
10 |
|
|
214 |
P1762E Tree Sum
|
0 / 0 |
10 |
|
|
206 |
P1763F Edge Queries
|
0 / 0 |
10 |
|
|
200 |
P1764F Doremy's Experimental Tree
|
0 / 0 |
9 |
|
|
171 |
P1767E Algebra Flash
|
0 / 0 |
9 |
|
|
170 |
P1767F Two Subtrees
|
0 / 0 |
10 |
|
|
159 |
P1770E Koxia and Tree
|
0 / 0 |
9 |
|
|
152 |
P1771D Hossam and (sub-)palindromic tree
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
150 |
P1771F Hossam and Range Minimum Query
|
0 / 0 |
9 |
