|
|
32892 |
codeforces#P1671E
Preorder
|
0 / 0 |
(无) |
|
|
32920 |
codeforces#P1675D
Vertical Paths
|
0 / 0 |
(无) |
|
|
32922 |
codeforces#P1675F
Vlad and Unfinished Business
|
0 / 0 |
(无) |
|
|
32930 |
codeforces#P1676G
White-Black Balanced Subtrees
|
0 / 0 |
(无) |
|
|
32959 |
codeforces#P1681F
Unique Occurrences
|
1 / 1 |
10 |
|
|
32963 |
codeforces#P1682D
Circular Spanning Tree
|
0 / 0 |
(无) |
|
|
32983 |
codeforces#P1687B
Railway System
|
0 / 0 |
(无) |
|
|
32993 |
codeforces#P1689C
Infected Tree
|
0 / 0 |
(无) |
|
|
33008 |
codeforces#P1691F
K-Set Tree
|
1 / 2 |
10 |
|
|
33018 |
codeforces#P1693B
Fake Plastic Trees
|
0 / 0 |
(无) |
|
|
33028 |
codeforces#P1695D1
Tree Queries (Easy Version)
|
0 / 0 |
(无) |
|
|
33029 |
codeforces#P1695D2
Tree Queries (Hard Version)
|
0 / 0 |
(无) |
|
|
33036 |
codeforces#P1696F
Tree Recovery
|
0 / 0 |
(无) |
|
|
33075 |
codeforces#P1702G1
Passable Paths (easy version)
|
0 / 0 |
6 |
|
|
33076 |
codeforces#P1702G2
Passable Paths (hard version)
|
0 / 0 |
7 |
|
|
33104 |
codeforces#P1706E
Qpwoeirut and Vertices
|
0 / 0 |
(无) |
|
|
33107 |
codeforces#P1707C
DFS Trees
|
1 / 1 |
10 |
|
|
33108 |
codeforces#P1707D
Partial Virtual Trees
|
0 / 0 |
(无) |
|
|
33117 |
codeforces#P1709E
XOR Tree
|
0 / 0 |
(无) |
|
|
33118 |
codeforces#P1709F
Multiset of Strings
|
0 / 1 |
10 |
|
|
33122 |
codeforces#P1710D
Recover the Tree
|
0 / 0 |
(无) |
|
|
33132 |
codeforces#P1712F
Triameter
|
0 / 0 |
(无) |
|
|
33144 |
codeforces#P1714F
Build a Tree and That Is It
|
0 / 0 |
(无) |
|
|
33145 |
codeforces#P1714G
Path Prefixes
|
0 / 0 |
(无) |
|
|
33168 |
codeforces#P1718D
Permutation for Burenka
|
0 / 1 |
10 |
|
|
33177 |
codeforces#P1720D1
Xor-Subsequence (easy version)
|
0 / 0 |
(无) |
|
|
33178 |
codeforces#P1720D2
Xor-Subsequence (hard version)
|
0 / 0 |
(无) |
|
|
33184 |
codeforces#P1721E
Prefix Function Queries
|
0 / 0 |
(无) |
|
|
33197 |
codeforces#P1725E
Electrical Efficiency
|
0 / 0 |
(无) |
|
|
33201 |
codeforces#P1725I
Imitating the Key Tree
|
0 / 0 |
(无) |
|
|
33202 |
codeforces#P1725J
Journey
|
0 / 0 |
(无) |
|
|
33209 |
codeforces#P1726D
Edge Split
|
0 / 0 |
(无) |
|
|
33281 |
codeforces#P1738D
Permutation Addicts
|
0 / 0 |
(无) |
|
|
33283 |
codeforces#P1738F
Connectivity Addicts
|
0 / 0 |
(无) |
|
|
33289 |
codeforces#P1739D
Reset K Edges
|
0 / 0 |
(无) |
|
|
33296 |
codeforces#P1740E
Hanging Hearts
|
0 / 0 |
(无) |
|
|
33299 |
codeforces#P1740H
MEX Tree Manipulation
|
0 / 1 |
10 |
|
|
33304 |
codeforces#P1741D
Masha and a Beautiful Tree
|
0 / 0 |
(无) |
|
|
33332 |
codeforces#P1746D
Paths on the Tree
|
1 / 4 |
6 |
|
|
33346 |
codeforces#P1748E
Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
|
33353 |
codeforces#P1749F
Distance to the Path
|
0 / 0 |
(无) |
|
|
33398 |
codeforces#P1761G
Centroid Guess
|
0 / 0 |
(无) |
|
|
33403 |
codeforces#P1762E
Tree Sum
|
0 / 0 |
(无) |
|
|
33417 |
codeforces#P1764F
Doremy's Experimental Tree
|
0 / 0 |
(无) |
|
|
33446 |
codeforces#P1767E
Algebra Flash
|
0 / 0 |
(无) |
|
|
33447 |
codeforces#P1767F
Two Subtrees
|
0 / 0 |
(无) |
|
|
33458 |
codeforces#P1770E
Koxia and Tree
|
0 / 0 |
(无) |
|
|
33465 |
codeforces#P1771D
Hossam and (sub-)palindromic tree
|
0 / 0 |
(无) |
|
|
33467 |
codeforces#P1771F
Hossam and Range Minimum Query
|
1 / 2 |
10 |
|
|
33469 |
codeforces#P1773B
BinCoin
|
0 / 0 |
8 |
