|
|
343 |
P1676G
White-Black Balanced Subtrees
|
0 / 0 |
4 |
|
|
320 |
P1680F
Lenient Vertex Cover
|
0 / 0 |
10 |
|
|
314 |
P1681F
Unique Occurrences
|
0 / 0 |
8 |
|
|
310 |
P1682D
Circular Spanning Tree
|
0 / 0 |
7 |
|
|
309 |
P1682E
Unordered Swaps
|
0 / 0 |
10 |
|
|
280 |
P1689C
Infected Tree
|
0 / 0 |
5 |
|
|
265 |
P1691F
K-Set Tree
|
0 / 0 |
9 |
|
|
255 |
P1693B
Fake Plastic Trees
|
0 / 0 |
5 |
|
|
245 |
P1695D1
Tree Queries (Easy Version)
|
0 / 0 |
8 |
|
|
244 |
P1695D2
Tree Queries (Hard Version)
|
0 / 0 |
8 |
|
|
237 |
P1696F
Tree Recovery
|
0 / 0 |
10 |
|
|
224 |
P1698E
PermutationForces II
|
0 / 0 |
8 |
|
|
198 |
P1702G1
Passable Paths (easy version)
|
0 / 0 |
6 |
|
|
197 |
P1702G2
Passable Paths (hard version)
|
0 / 0 |
7 |
|
|
169 |
P1706E
Qpwoeirut and Vertices
|
0 / 0 |
8 |
|
|
166 |
P1707C
DFS Trees
|
0 / 0 |
9 |
|
|
165 |
P1707D
Partial Virtual Trees
|
1 / 1 |
10 |
|
|
156 |
P1709E
XOR Tree
|
0 / 0 |
9 |
|
|
155 |
P1709F
Multiset of Strings
|
0 / 0 |
9 |
|
|
151 |
P1710D
Recover the Tree
|
0 / 0 |
10 |
|
|
141 |
P1712F
Triameter
|
0 / 1 |
10 |
|
|
129 |
P1714F
Build a Tree and That Is It
|
0 / 0 |
6 |
|
|
128 |
P1714G
Path Prefixes
|
0 / 0 |
5 |
|
|
105 |
P1718D
Permutation for Burenka
|
0 / 0 |
10 |
|
|
96 |
P1720D1
Xor-Subsequence (easy version)
|
1 / 1 |
6 |
|
|
95 |
P1720D2
Xor-Subsequence (hard version)
|
1 / 1 |
9 |
|
|
89 |
P1721E
Prefix Function Queries
|
0 / 0 |
8 |
|
|
76 |
P1725E
Electrical Efficiency
|
0 / 0 |
9 |
|
|
72 |
P1725I
Imitating the Key Tree
|
0 / 0 |
10 |
|
|
71 |
P1725J
Journey
|
0 / 0 |
9 |
|
|
64 |
P1726D
Edge Split
|
0 / 0 |
7 |
|
|
11 |
P1738D
Permutation Addicts
|
0 / 0 |
6 |
|
|
9 |
P1738F
Connectivity Addicts
|
0 / 0 |
9 |
|
|
3 |
P1739D
Reset K Edges
|
0 / 0 |
(无) |
|
|
8170 |
P1740E
Hanging Hearts
|
0 / 0 |
6 |
|
|
8167 |
P1740H
MEX Tree Manipulation
|
0 / 0 |
10 |
|
|
8095 |
P1741D
Masha and a Beautiful Tree
|
0 / 0 |
(无) |
|
|
8109 |
P1746D
Paths on the Tree
|
0 / 0 |
(无) |
|
|
8156 |
P1748E
Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
|
8128 |
P1749F
Distance to the Path
|
0 / 0 |
(无) |
|
|
8238 |
P1767E
Algebra Flash
|
0 / 0 |
9 |
|
|
8237 |
P1767F
Two Subtrees
|
0 / 0 |
10 |
|
|
8226 |
P1770E
Koxia and Tree
|
0 / 0 |
(无) |
|
|
8219 |
P1771D
Hossam and (sub-)palindromic tree
|
0 / 0 |
7 |
|
|
8217 |
P1771F
Hossam and Range Minimum Query
|
0 / 0 |
9 |
|
|
8208 |
P1773B
BinCoin
|
0 / 0 |
8 |
|
|
8194 |
P1774E
Two Chess Pieces
|
0 / 0 |
6 |
|
|
8191 |
P1774G
Segment Covering
|
0 / 0 |
10 |
|
|
8290 |
P1777D
Score of a Tree
|
0 / 0 |
(无) |
|
|
8289 |
P1777E
Edge Reverse
|
0 / 0 |
(无) |
