|
7770 |
P1680F
Lenient Vertex Cover
|
0 / 0 |
(无) |
|
7784 |
P1682D
Circular Spanning Tree
|
0 / 0 |
(无) |
|
7843 |
P1689C
Infected Tree
|
0 / 0 |
(无) |
|
7828 |
P1691F
K-Set Tree
|
0 / 0 |
(无) |
|
7818 |
P1693B
Fake Plastic Trees
|
0 / 0 |
(无) |
|
7808 |
P1695D1
Tree Queries (Easy Version)
|
0 / 0 |
(无) |
|
7807 |
P1695D2
Tree Queries (Hard Version)
|
0 / 0 |
(无) |
|
7931 |
P1696F
Tree Recovery
|
0 / 0 |
(无) |
|
7924 |
P1698E
PermutationForces II
|
0 / 0 |
(无) |
|
7904 |
P1702G1
Passable Paths (easy version)
|
0 / 0 |
(无) |
|
7903 |
P1702G2
Passable Paths (hard version)
|
0 / 0 |
(无) |
|
7884 |
P1706E
Qpwoeirut and Vertices
|
0 / 0 |
(无) |
|
7881 |
P1707C
DFS Trees
|
0 / 0 |
(无) |
|
7880 |
P1707D
Partial Virtual Trees
|
0 / 0 |
(无) |
|
7871 |
P1709E
XOR Tree
|
0 / 0 |
(无) |
|
7870 |
P1709F
Multiset of Strings
|
0 / 0 |
(无) |
|
7866 |
P1710D
Recover the Tree
|
0 / 0 |
(无) |
|
7972 |
P1712F
Triameter
|
0 / 0 |
(无) |
|
7960 |
P1714F
Build a Tree and That Is It
|
0 / 0 |
(无) |
|
7959 |
P1714G
Path Prefixes
|
0 / 0 |
(无) |
|
7988 |
P1715E
Long Way Home
|
0 / 0 |
(无) |
|
7948 |
P1718D
Permutation for Burenka
|
0 / 0 |
(无) |
|
7939 |
P1720D1
Xor-Subsequence (easy version)
|
0 / 0 |
(无) |
|
7938 |
P1720D2
Xor-Subsequence (hard version)
|
0 / 0 |
(无) |
|
8043 |
P1721E
Prefix Function Queries
|
0 / 0 |
(无) |
|
8030 |
P1725E
Electrical Efficiency
|
0 / 0 |
(无) |
|
8026 |
P1725I
Imitating the Key Tree
|
0 / 0 |
(无) |
|
8025 |
P1725J
Journey
|
0 / 0 |
(无) |
|
8018 |
P1726D
Edge Split
|
0 / 0 |
(无) |
|
8076 |
P1738D
Permutation Addicts
|
0 / 0 |
6 |
|
8074 |
P1738F
Connectivity Addicts
|
0 / 0 |
9 |
|
8068 |
P1739D
Reset K Edges
|
0 / 0 |
(无) |
|
8176 |
P1746D
Paths on the Tree
|
0 / 0 |
6 |
|
8162 |
P1748E
Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
8155 |
P1749F
Distance to the Path
|
0 / 0 |
10 |
|
8113 |
P1761E
Make It Connected
|
0 / 0 |
9 |
|
8110 |
P1761G
Centroid Guess
|
0 / 0 |
10 |
|
8248 |
P1762E
Tree Sum
|
0 / 0 |
10 |
|
8240 |
P1763F
Edge Queries
|
0 / 0 |
10 |
|
8104 |
P1764F
Doremy's Experimental Tree
|
0 / 0 |
9 |
|
8229 |
P1767E
Algebra Flash
|
0 / 0 |
9 |
|
8228 |
P1767F
Two Subtrees
|
0 / 0 |
10 |
|
8223 |
P1770E
Koxia and Tree
|
0 / 0 |
(无) |
|
8216 |
P1771D
Hossam and (sub-)palindromic tree
|
0 / 0 |
7 |
|
8214 |
P1771F
Hossam and Range Minimum Query
|
0 / 0 |
9 |
|
8195 |
P1773B
BinCoin
|
0 / 0 |
8 |
|
8202 |
P1774E
Two Chess Pieces
|
0 / 0 |
6 |
|
8199 |
P1774G
Segment Covering
|
0 / 0 |
10 |
|
8255 |
P1779F
Xorcerer's Stones
|
0 / 0 |
(无) |
|
8261 |
P1783G
Weighed Tree Radius
|
0 / 0 |
(无) |
|
8359 |
P1842F
Tenzing and Tree
|
0 / 0 |
9 |
|
8350 |
P1843C
Sum in Binary Tree
|
0 / 0 |
3 |
|
8351 |
P1843C
Sum in Binary Tree
|
0 / 0 |
3 |
|
8349 |
P1843D
Apple Tree
|
0 / 0 |
4 |
|
8346 |
P1843F1
Omsk Metro (simple version)
|
0 / 0 |
6 |
|
8344 |
P1843F2
Omsk Metro (hard version)
|
0 / 0 |
8 |
|
8334 |
P1844G
Tree Weights
|
0 / 0 |
10 |
|
8409 |
P1849F
XOR Partition
|
0 / 0 |
(无) |
|
8289 |
P1851F
Lisa and the Martians
|
0 / 0 |
(无) |
|
8290 |
P1851G
Vlad and the Mountains
|
0 / 0 |
(无) |
|
8404 |
P1854D
Michael and Hotel
|
0 / 0 |
(无) |
|
8545 |
P1861C
Queries for the Array
|
0 / 0 |
5 |
|
8546 |
P1861C
Queries for the Array
|
0 / 0 |
5 |
|
8518 |
P1863H
Goldberg Machine 3
|
0 / 0 |
10 |
|
8519 |
P1863H
Goldberg Machine 3
|
0 / 0 |
10 |
|
8517 |
P1863I
Redundant Routes
|
0 / 0 |
10 |
|
8509 |
P1864E
Guess Game
|
0 / 0 |
7 |
|
8510 |
P1864E
Guess Game
|
0 / 0 |
7 |
|
8488 |
P1866K
Keen Tree Calculation
|
0 / 0 |
9 |
|
8489 |
P1866K
Keen Tree Calculation
|
0 / 0 |
9 |
|
8468 |
P1868C
Travel Plan
|
0 / 0 |
9 |
|
8467 |
P1868D
Flower-like Pseudotree
|
0 / 0 |
10 |
|
8450 |
P1870H
Standard Graph Problem
|
0 / 0 |
10 |
|
8451 |
P1870H
Standard Graph Problem
|
0 / 0 |
10 |
|
8434 |
P1873H
Mad City
|
0 / 0 |
5 |
|
8567 |
P1876E
Ball-Stackable
|
0 / 0 |
(无) |
|
8565 |
P1876G
Clubstep
|
0 / 0 |
(无) |
|
8427 |
P1878G
wxhtzdy ORO Tree
|
0 / 0 |
(无) |
|
8421 |
P1879E
Interactive Game with Coloring
|
0 / 0 |
9 |
|
8578 |
P1881F
Minimum Maximum Distance
|
0 / 0 |
(无) |
|
8418 |
P1882D
Tree XOR
|
0 / 0 |
(无) |
|
8586 |
P1887D
Split
|
0 / 0 |
(无) |
|
8601 |
P1889D
Game of Stacks
|
0 / 0 |
(无) |
|
8599 |
P1889E
Doremy's Swapping Trees
|
0 / 0 |
(无) |
|
8600 |
P1889F
Doremy's Average Tree
|
0 / 0 |
(无) |
|
8618 |
P1891F
A Growing Tree
|
0 / 0 |
(无) |
|
8620 |
P1891F
A Growing Tree
|
0 / 0 |
(无) |
|
8719 |
P1899F
Alex's whims
|
0 / 0 |
5 |
|
8718 |
P1899G
Unusual Entertainment
|
0 / 0 |
6 |
|
8715 |
P1900C
Anji's Binary Tree
|
0 / 0 |
4 |
|
8707 |
P1901E
Compressed Tree
|
0 / 0 |
8 |
|
8701 |
P1902E
Collapsing Strings
|
0 / 0 |
6 |
|
8699 |
P1902F
Trees and XOR Queries Again
|
0 / 0 |
9 |
|
8693 |
P1903F
Babysitting
|
0 / 0 |
9 |
|
8688 |
P1904E
Tree Queries
|
0 / 0 |
(无) |
|
8686 |
P1904F
Beautiful Tree
|
0 / 0 |
(无) |
|
8684 |
P1905B
Begginer's Zelda
|
0 / 0 |
(无) |
|
8681 |
P1905E
One-X
|
0 / 0 |
(无) |
|
8654 |
P1910F
Build Railway Stations
|
0 / 0 |
7 |
|
8635 |
P1913D
Array Collapse
|
0 / 0 |
(无) |