|
7816 |
P1671E Preorder
|
0 / 0 |
(无) |
|
7868 |
P1675D Vertical Paths
|
0 / 0 |
(无) |
|
7866 |
P1675F Vlad and Unfinished Business
|
0 / 0 |
(无) |
|
7889 |
P1676G White-Black Balanced Subtrees
|
0 / 0 |
(无) |
|
7922 |
P1681F Unique Occurrences
|
1 / 1 |
10 |
|
7918 |
P1682D Circular Spanning Tree
|
0 / 0 |
(无) |
|
7949 |
P1687B Railway System
|
0 / 0 |
(无) |
|
7966 |
P1689C Infected Tree
|
0 / 0 |
(无) |
|
7936 |
P1691F K-Set Tree
|
1 / 2 |
10 |
|
7995 |
P1693B Fake Plastic Trees
|
0 / 0 |
(无) |
|
7985 |
P1695D1 Tree Queries (Easy Version)
|
0 / 0 |
(无) |
|
7984 |
P1695D2 Tree Queries (Hard Version)
|
0 / 0 |
(无) |
|
7999 |
P1696F Tree Recovery
|
0 / 0 |
(无) |
|
8024 |
P1702G1 Passable Paths (easy version)
|
0 / 0 |
6 |
|
8023 |
P1702G2 Passable Paths (hard version)
|
0 / 0 |
7 |
|
8046 |
P1706E Qpwoeirut and Vertices
|
0 / 0 |
(无) |
|
8043 |
P1707C DFS Trees
|
0 / 0 |
(无) |
|
8042 |
P1707D Partial Virtual Trees
|
0 / 0 |
(无) |
|
8066 |
P1709E XOR Tree
|
0 / 0 |
(无) |
|
8065 |
P1709F Multiset of Strings
|
0 / 0 |
(无) |
|
8061 |
P1710D Recover the Tree
|
0 / 0 |
(无) |
|
8099 |
P1712F Triameter
|
0 / 0 |
(无) |
|
8081 |
P1714F Build a Tree and That Is It
|
0 / 0 |
(无) |
|
8080 |
P1714G Path Prefixes
|
0 / 0 |
(无) |
|
8117 |
P1718D Permutation for Burenka
|
0 / 1 |
10 |
|
8111 |
P1720D1 Xor-Subsequence (easy version)
|
0 / 0 |
(无) |
|
8110 |
P1720D2 Xor-Subsequence (hard version)
|
0 / 0 |
(无) |
|
8129 |
P1721E Prefix Function Queries
|
0 / 0 |
(无) |
|
8149 |
P1725E Electrical Efficiency
|
0 / 0 |
(无) |
|
8145 |
P1725I Imitating the Key Tree
|
0 / 0 |
(无) |
|
8144 |
P1725J Journey
|
0 / 0 |
(无) |
|
8164 |
P1726D Edge Split
|
0 / 0 |
(无) |
|
8210 |
P1738D Permutation Addicts
|
0 / 0 |
(无) |
|
8208 |
P1738F Connectivity Addicts
|
0 / 0 |
(无) |
|
8202 |
P1739D Reset K Edges
|
0 / 0 |
(无) |
|
8292 |
P1740E Hanging Hearts
|
0 / 0 |
(无) |
|
8289 |
P1740H MEX Tree Manipulation
|
0 / 0 |
(无) |
|
8236 |
P1741D Masha and a Beautiful Tree
|
0 / 0 |
(无) |
|
8251 |
P1746D Paths on the Tree
|
1 / 4 |
6 |
|
8311 |
P1748E Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
8269 |
P1749F Distance to the Path
|
0 / 0 |
(无) |
|
8323 |
P1761G Centroid Guess
|
0 / 0 |
(无) |
|
8394 |
P1762E Tree Sum
|
0 / 0 |
(无) |
|
8348 |
P1764F Doremy's Experimental Tree
|
0 / 0 |
(无) |
|
8400 |
P1767E Algebra Flash
|
0 / 0 |
(无) |
|
8399 |
P1767F Two Subtrees
|
0 / 0 |
(无) |
|
8423 |
P1770E Koxia and Tree
|
0 / 0 |
(无) |
|
8382 |
P1771D Hossam and (sub-)palindromic tree
|
0 / 0 |
(无) |
|
8380 |
P1771F Hossam and Range Minimum Query
|
0 / 0 |
(无) |
|
8378 |
P1773B BinCoin
|
0 / 0 |
8 |