|
485 |
P1669G
Fall Down
|
0 / 0 |
4 |
|
481 |
P1670C
Where is the Pizza?
|
0 / 0 |
4 |
|
479 |
P1670E
Hemose on the Tree
|
0 / 0 |
8 |
|
465 |
P1672F2
Checker for Array Shuffling
|
0 / 0 |
10 |
|
449 |
P1674G
Remove Directed Edges
|
0 / 0 |
7 |
|
443 |
P1675F
Vlad and Unfinished Business
|
0 / 0 |
6 |
|
435 |
P1676G
White-Black Balanced Subtrees
|
0 / 0 |
4 |
|
430 |
P1677C
Tokitsukaze and Two Colorful Tapes
|
0 / 0 |
6 |
|
420 |
P1679D
Toss a Coin to Your Graph...
|
0 / 0 |
6 |
|
412 |
P1680F
Lenient Vertex Cover
|
0 / 0 |
10 |
|
408 |
P1681D
Required Length
|
0 / 0 |
5 |
|
406 |
P1681F
Unique Occurrences
|
0 / 0 |
8 |
|
401 |
P1682E
Unordered Swaps
|
0 / 0 |
10 |
|
392 |
P1684H
Hard Cut
|
0 / 0 |
10 |
|
388 |
P1685D1
Permutation Weight (Easy Version)
|
0 / 0 |
10 |
|
372 |
P1689C
Infected Tree
|
0 / 0 |
5 |
|
370 |
P1689E
ANDfinity
|
0 / 0 |
9 |
|
358 |
P1691E
Number of Groups
|
0 / 0 |
8 |
|
357 |
P1691F
K-Set Tree
|
0 / 0 |
9 |
|
347 |
P1693B
Fake Plastic Trees
|
0 / 0 |
5 |
|
337 |
P1695D1
Tree Queries (Easy Version)
|
0 / 0 |
8 |
|
336 |
P1695D2
Tree Queries (Hard Version)
|
0 / 0 |
8 |
|
335 |
P1695E
Ambiguous Dominoes
|
0 / 0 |
10 |
|
329 |
P1696F
Tree Recovery
|
0 / 0 |
10 |
|
292 |
P1702E
Split Into Two Sets
|
0 / 0 |
5 |
|
290 |
P1702G1
Passable Paths (easy version)
|
0 / 0 |
6 |
|
289 |
P1702G2
Passable Paths (hard version)
|
0 / 0 |
7 |
|
261 |
P1706E
Qpwoeirut and Vertices
|
0 / 0 |
8 |
|
258 |
P1707C
DFS Trees
|
0 / 0 |
9 |
|
257 |
P1707D
Partial Virtual Trees
|
0 / 0 |
10 |
|
248 |
P1709E
XOR Tree
|
0 / 0 |
9 |
|
233 |
P1712F
Triameter
|
0 / 0 |
10 |
|
220 |
P1714G
Path Prefixes
|
0 / 0 |
5 |
|
209 |
P1716E
Swap and Maximum Block
|
0 / 0 |
9 |
|
182 |
P1721D
Maximum AND
|
0 / 0 |
6 |
|
181 |
P1721E
Prefix Function Queries
|
0 / 0 |
8 |
|
180 |
P1721F
Matching Reduction
|
0 / 0 |
10 |
|
174 |
P1722F
L-shapes
|
0 / 0 |
5 |
|
156 |
P1726D
Edge Split
|
0 / 0 |
7 |
|
110 |
P1735C
Phase Shift
|
0 / 0 |
4 |
|
90 |
P1738D
Permutation Addicts
|
0 / 0 |
6 |
|
82 |
P1739D
Reset K Edges
|
0 / 0 |
6 |
|
75 |
P1740E
Hanging Hearts
|
0 / 0 |
6 |
|
67 |
P1741D
Masha and a Beautiful Tree
|
0 / 0 |
4 |
|
64 |
P1741G
Kirill and Company
|
0 / 0 |
8 |
|
39 |
P1746D
Paths on the Tree
|
0 / 0 |
6 |
|
19 |
P1749E
Cactus Wall
|
0 / 0 |
9 |
|
18 |
P1749F
Distance to the Path
|
0 / 0 |
10 |
|
5 |
P1753D
The Beach
|
0 / 0 |
9 |
|
8225 |
P1758E
Tick, Tock
|
0 / 0 |
9 |
|
8193 |
P1760G
SlavicG's Favorite Problem
|
0 / 0 |
(无) |
|
8183 |
P1761C
Set Construction
|
0 / 0 |
(无) |
|
8218 |
P1764F
Doremy's Experimental Tree
|
0 / 0 |
9 |
|
8311 |
P1770D
Koxia and Game
|
0 / 0 |
7 |
|
8310 |
P1770E
Koxia and Tree
|
0 / 0 |
9 |
|
8303 |
P1771D
Hossam and (sub-)palindromic tree
|
0 / 0 |
7 |
|
8256 |
P1774E
Two Chess Pieces
|
0 / 0 |
6 |
|
8247 |
P1775D
Friendly Spiders
|
0 / 0 |
(无) |
|
8294 |
P1777D
Score of a Tree
|
0 / 0 |
(无) |
|
8293 |
P1777E
Edge Reverse
|
0 / 0 |
(无) |
|
8332 |
P1778E
The Tree Has Fallen!
|
0 / 0 |
(无) |
|
8331 |
P1778F
Maximizing Root
|
0 / 0 |
(无) |
|
8231 |
P1783F
Double Sort II
|
0 / 0 |
(无) |
|
8327 |
P1787D
Game on Axis
|
0 / 0 |
(无) |
|
8361 |
P1788E
Sum Over Zero
|
0 / 0 |
(无) |
|
8360 |
P1788F
XOR, Tree, and Queries
|
0 / 0 |
(无) |
|
8316 |
P1790F
Timofey and Black-White Tree
|
0 / 0 |
(无) |
|
8315 |
P1790G
Tokens on Graph
|
0 / 0 |
(无) |
|
8272 |
P1792E
Divisors and Table
|
0 / 0 |
(无) |
|
8367 |
P1795F
Blocking Chips
|
0 / 0 |
9 |
|
8366 |
P1795G
Removal Sequences
|
0 / 0 |
10 |
|
8398 |
P1796E
Colored Subgraphs
|
0 / 0 |
9 |
|
8391 |
P1799E
City Union
|
0 / 0 |
(无) |
|
8388 |
P1799H
Tree Cutting
|
0 / 0 |
(无) |
|
8379 |
P1800G
Symmetree
|
0 / 0 |
(无) |
|
8426 |
P1804E
Routing
|
0 / 0 |
9 |
|
8475 |
P1805D
A Wide, Wide Graph
|
0 / 0 |
(无) |
|
8474 |
P1805E
There Should Be a Lot of Maximums
|
0 / 0 |
(无) |
|
8418 |
P1806E
Tree Master
|
0 / 0 |
8 |
|
8410 |
P1807F
Bouncy Ball
|
0 / 0 |
(无) |
|
8453 |
P1810E
Monsters
|
0 / 0 |
7 |
|
8582 |
P1840F
Railguns
|
0 / 0 |
8 |
|
8568 |
P1842F
Tenzing and Tree
|
0 / 0 |
9 |
|
8561 |
P1843D
Apple Tree
|
0 / 0 |
4 |
|
8559 |
P1843F1
Omsk Metro (simple version)
|
0 / 0 |
6 |
|
8558 |
P1843F2
Omsk Metro (hard version)
|
0 / 0 |
8 |
|
8553 |
P1844E
Great Grids
|
0 / 0 |
9 |
|
8550 |
P1844G
Tree Weights
|
0 / 0 |
10 |
|
8529 |
P1847F
The Boss's Identity
|
0 / 0 |
9 |
|
8509 |
P1850H
The Third Letter
|
0 / 0 |
5 |
|
8504 |
P1851E
Nastya and Potions
|
0 / 0 |
(无) |
|
8627 |
P1856E1
PermuTree (easy version)
|
0 / 0 |
6 |
|
8626 |
P1856E2
PermuTree (hard version)
|
0 / 0 |
10 |
|
8614 |
P1858E1
Rollbacks (Easy Version)
|
0 / 0 |
9 |
|
8607 |
P1859F
Teleportation in Byteland
|
0 / 0 |
10 |
|
8602 |
P1860E
Fast Travel Text Editor
|
0 / 0 |
(无) |
|
8715 |
P1861C
Queries for the Array
|
0 / 0 |
5 |
|
8707 |
P1863E
Speedrun
|
0 / 0 |
7 |
|
8700 |
P1866C
Completely Searching for Inversions
|
0 / 0 |
6 |
|
8686 |
P1867D
Cyclic Operations
|
0 / 0 |
6 |