|
|
917 |
P1676G
White-Black Balanced Subtrees
|
0 / 0 |
4 |
|
|
894 |
P1680F
Lenient Vertex Cover
|
0 / 0 |
10 |
|
|
888 |
P1681F
Unique Occurrences
|
0 / 0 |
8 |
|
|
884 |
P1682D
Circular Spanning Tree
|
0 / 0 |
7 |
|
|
883 |
P1682E
Unordered Swaps
|
0 / 0 |
10 |
|
|
854 |
P1689C
Infected Tree
|
0 / 0 |
5 |
|
|
839 |
P1691F
K-Set Tree
|
0 / 0 |
9 |
|
|
829 |
P1693B
Fake Plastic Trees
|
0 / 0 |
5 |
|
|
819 |
P1695D1
Tree Queries (Easy Version)
|
0 / 0 |
8 |
|
|
818 |
P1695D2
Tree Queries (Hard Version)
|
0 / 0 |
8 |
|
|
811 |
P1696F
Tree Recovery
|
0 / 0 |
10 |
|
|
798 |
P1698E
PermutationForces II
|
0 / 0 |
8 |
|
|
761 |
P1702G1
Passable Paths (easy version)
|
0 / 0 |
6 |
|
|
760 |
P1702G2
Passable Paths (hard version)
|
0 / 0 |
7 |
|
|
732 |
P1706E
Qpwoeirut and Vertices
|
0 / 0 |
8 |
|
|
729 |
P1707C
DFS Trees
|
0 / 0 |
9 |
|
|
728 |
P1707D
Partial Virtual Trees
|
0 / 0 |
10 |
|
|
719 |
P1709E
XOR Tree
|
0 / 0 |
9 |
|
|
718 |
P1709F
Multiset of Strings
|
0 / 0 |
9 |
|
|
714 |
P1710D
Recover the Tree
|
0 / 0 |
10 |
|
|
704 |
P1712F
Triameter
|
0 / 0 |
10 |
|
|
692 |
P1714F
Build a Tree and That Is It
|
0 / 0 |
6 |
|
|
691 |
P1714G
Path Prefixes
|
0 / 0 |
5 |
|
|
668 |
P1718D
Permutation for Burenka
|
0 / 0 |
10 |
|
|
659 |
P1720D1
Xor-Subsequence (easy version)
|
0 / 0 |
6 |
|
|
658 |
P1720D2
Xor-Subsequence (hard version)
|
0 / 0 |
9 |
|
|
652 |
P1721E
Prefix Function Queries
|
0 / 0 |
8 |
|
|
639 |
P1725E
Electrical Efficiency
|
0 / 0 |
9 |
|
|
635 |
P1725I
Imitating the Key Tree
|
0 / 0 |
10 |
|
|
634 |
P1725J
Journey
|
0 / 0 |
9 |
|
|
627 |
P1726D
Edge Split
|
0 / 0 |
7 |
|
|
555 |
P1738D
Permutation Addicts
|
0 / 0 |
6 |
|
|
553 |
P1738F
Connectivity Addicts
|
0 / 0 |
9 |
|
|
547 |
P1739D
Reset K Edges
|
0 / 0 |
6 |
|
|
540 |
P1740E
Hanging Hearts
|
0 / 0 |
6 |
|
|
537 |
P1740H
MEX Tree Manipulation
|
0 / 0 |
10 |
|
|
532 |
P1741D
Masha and a Beautiful Tree
|
0 / 0 |
4 |
|
|
504 |
P1746D
Paths on the Tree
|
0 / 0 |
6 |
|
|
490 |
P1748E
Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
|
483 |
P1749F
Distance to the Path
|
0 / 0 |
10 |
|
|
441 |
P1761E
Make It Connected
|
0 / 0 |
9 |
|
|
438 |
P1761G
Centroid Guess
|
0 / 0 |
10 |
|
|
433 |
P1762E
Tree Sum
|
0 / 0 |
10 |
|
|
425 |
P1763F
Edge Queries
|
0 / 0 |
10 |
|
|
419 |
P1764F
Doremy's Experimental Tree
|
0 / 0 |
9 |
|
|
390 |
P1767E
Algebra Flash
|
0 / 0 |
9 |
|
|
389 |
P1767F
Two Subtrees
|
0 / 0 |
10 |
|
|
378 |
P1770E
Koxia and Tree
|
0 / 0 |
9 |
|
|
371 |
P1771D
Hossam and (sub-)palindromic tree
|
0 / 0 |
7 |
|
|
369 |
P1771F
Hossam and Range Minimum Query
|
0 / 0 |
9 |
