|
|
1259 |
P1669G
Fall Down
|
0 / 0 |
4 |
|
|
1255 |
P1670C
Where is the Pizza?
|
0 / 0 |
4 |
|
|
1253 |
P1670E
Hemose on the Tree
|
0 / 0 |
8 |
|
|
1239 |
P1672F2
Checker for Array Shuffling
|
0 / 0 |
10 |
|
|
1223 |
P1674G
Remove Directed Edges
|
0 / 0 |
7 |
|
|
1217 |
P1675F
Vlad and Unfinished Business
|
0 / 0 |
6 |
|
|
1209 |
P1676G
White-Black Balanced Subtrees
|
0 / 0 |
4 |
|
|
1204 |
P1677C
Tokitsukaze and Two Colorful Tapes
|
0 / 0 |
6 |
|
|
1194 |
P1679D
Toss a Coin to Your Graph...
|
0 / 0 |
6 |
|
|
1186 |
P1680F
Lenient Vertex Cover
|
0 / 0 |
10 |
|
|
1182 |
P1681D
Required Length
|
0 / 0 |
5 |
|
|
1180 |
P1681F
Unique Occurrences
|
0 / 0 |
8 |
|
|
1175 |
P1682E
Unordered Swaps
|
0 / 0 |
10 |
|
|
1166 |
P1684H
Hard Cut
|
0 / 0 |
10 |
|
|
1162 |
P1685D1
Permutation Weight (Easy Version)
|
0 / 0 |
10 |
|
|
1146 |
P1689C
Infected Tree
|
0 / 0 |
5 |
|
|
1144 |
P1689E
ANDfinity
|
0 / 0 |
9 |
|
|
1132 |
P1691E
Number of Groups
|
0 / 0 |
8 |
|
|
1131 |
P1691F
K-Set Tree
|
0 / 0 |
9 |
|
|
1121 |
P1693B
Fake Plastic Trees
|
0 / 0 |
5 |
|
|
1111 |
P1695D1
Tree Queries (Easy Version)
|
0 / 0 |
8 |
|
|
1110 |
P1695D2
Tree Queries (Hard Version)
|
0 / 0 |
8 |
|
|
1109 |
P1695E
Ambiguous Dominoes
|
0 / 0 |
10 |
|
|
1103 |
P1696F
Tree Recovery
|
0 / 0 |
10 |
|
|
1066 |
P1702E
Split Into Two Sets
|
0 / 0 |
5 |
|
|
1064 |
P1702G1
Passable Paths (easy version)
|
0 / 0 |
6 |
|
|
1063 |
P1702G2
Passable Paths (hard version)
|
0 / 0 |
7 |
|
|
1035 |
P1706E
Qpwoeirut and Vertices
|
0 / 0 |
8 |
|
|
1032 |
P1707C
DFS Trees
|
0 / 0 |
9 |
|
|
1031 |
P1707D
Partial Virtual Trees
|
0 / 0 |
10 |
|
|
1022 |
P1709E
XOR Tree
|
0 / 0 |
9 |
|
|
1007 |
P1712F
Triameter
|
0 / 0 |
10 |
|
|
994 |
P1714G
Path Prefixes
|
0 / 0 |
5 |
|
|
983 |
P1716E
Swap and Maximum Block
|
0 / 0 |
9 |
|
|
956 |
P1721D
Maximum AND
|
0 / 0 |
6 |
|
|
955 |
P1721E
Prefix Function Queries
|
0 / 0 |
8 |
|
|
954 |
P1721F
Matching Reduction
|
0 / 0 |
10 |
|
|
948 |
P1722F
L-shapes
|
0 / 0 |
5 |
|
|
930 |
P1726D
Edge Split
|
0 / 0 |
7 |
|
|
878 |
P1735C
Phase Shift
|
0 / 0 |
4 |
|
|
858 |
P1738D
Permutation Addicts
|
0 / 0 |
6 |
|
|
850 |
P1739D
Reset K Edges
|
0 / 0 |
6 |
|
|
843 |
P1740E
Hanging Hearts
|
0 / 0 |
6 |
|
|
835 |
P1741D
Masha and a Beautiful Tree
|
0 / 0 |
4 |
|
|
832 |
P1741G
Kirill and Company
|
0 / 0 |
8 |
|
|
807 |
P1746D
Paths on the Tree
|
0 / 0 |
6 |
|
|
787 |
P1749E
Cactus Wall
|
0 / 0 |
9 |
|
|
786 |
P1749F
Distance to the Path
|
0 / 0 |
10 |
|
|
773 |
P1753D
The Beach
|
0 / 0 |
9 |
|
|
764 |
P1758E
Tick, Tock
|
0 / 0 |
9 |
|
|
749 |
P1760G
SlavicG's Favorite Problem
|
0 / 0 |
5 |
|
|
746 |
P1761C
Set Construction
|
0 / 0 |
4 |
|
|
728 |
P1763F
Edge Queries
|
0 / 0 |
10 |
|
|
722 |
P1764F
Doremy's Experimental Tree
|
0 / 0 |
9 |
|
|
688 |
P1768D
Lucky Permutation
|
0 / 0 |
6 |
|
|
682 |
P1770D
Koxia and Game
|
0 / 0 |
7 |
|
|
681 |
P1770E
Koxia and Tree
|
0 / 0 |
9 |
|
|
674 |
P1771D
Hossam and (sub-)palindromic tree
|
0 / 0 |
7 |
|
|
655 |
P1774E
Two Chess Pieces
|
0 / 0 |
6 |
|
|
646 |
P1775D
Friendly Spiders
|
0 / 0 |
6 |
|
|
626 |
P1777D
Score of a Tree
|
0 / 0 |
6 |
|
|
625 |
P1777E
Edge Reverse
|
0 / 0 |
8 |
|
|
619 |
P1778E
The Tree Has Fallen!
|
0 / 0 |
9 |
|
|
618 |
P1778F
Maximizing Root
|
0 / 0 |
10 |
|
|
589 |
P1783F
Double Sort II
|
0 / 0 |
9 |
|
|
575 |
P1787D
Game on Axis
|
0 / 0 |
6 |
|
|
565 |
P1788E
Sum Over Zero
|
0 / 0 |
8 |
|
|
564 |
P1788F
XOR, Tree, and Queries
|
0 / 0 |
9 |
|
|
552 |
P1790F
Timofey and Black-White Tree
|
0 / 0 |
7 |
|
|
551 |
P1790G
Tokens on Graph
|
0 / 0 |
8 |
|
|
538 |
P1792E
Divisors and Table
|
0 / 0 |
9 |
|
|
519 |
P1795F
Blocking Chips
|
0 / 0 |
9 |
|
|
518 |
P1795G
Removal Sequences
|
0 / 0 |
10 |
|
|
513 |
P1796E
Colored Subgraphs
|
0 / 0 |
9 |
|
|
508 |
P1797D
Li Hua and Tree
|
0 / 0 |
6 |
|
|
506 |
P1797F
Li Hua and Path
|
0 / 0 |
10 |
|
|
494 |
P1799E
City Union
|
0 / 0 |
8 |
|
|
491 |
P1799H
Tree Cutting
|
0 / 0 |
10 |
|
|
484 |
P1800E2
Unforgivable Curse (hard version)
|
0 / 0 |
5 |
|
|
482 |
P1800G
Symmetree
|
0 / 0 |
8 |
|
|
468 |
P1804E
Routing
|
0 / 0 |
9 |
|
|
461 |
P1805D
A Wide, Wide Graph
|
0 / 0 |
6 |
|
|
460 |
P1805E
There Should Be a Lot of Maximums
|
0 / 0 |
8 |
|
|
453 |
P1806E
Tree Master
|
0 / 0 |
8 |
|
|
445 |
P1807F
Bouncy Ball
|
0 / 0 |
5 |
|
|
424 |
P1810E
Monsters
|
0 / 0 |
7 |
|
|
415 |
P1811F
Is It Flower?
|
0 / 0 |
7 |
|
|
394 |
P1815C
Between
|
0 / 0 |
8 |
|
|
387 |
P1817B
Fish Graph
|
0 / 0 |
6 |
|
|
361 |
P1822F
Gardening Friends
|
0 / 0 |
5 |
|
|
350 |
P1824B2
LuoTianyi and the Floating Islands (Hard Version)
|
0 / 0 |
8 |
|
|
349 |
P1824C
LuoTianyi and XOR-Tree
|
0 / 0 |
9 |
|
|
334 |
P1827D
Two Centroids
|
0 / 0 |
10 |
|
|
333 |
P1827E
Bus Routes
|
0 / 0 |
10 |
|
|
326 |
P1829D
Gold Rush
|
0 / 0 |
3 |
|
|
325 |
P1829E
The Lakes
|
0 / 0 |
3 |
|
|
324 |
P1829F
Forever Winter
|
0 / 0 |
4 |
|
|
321 |
P1830A
Copil Copac Draws Trees
|
0 / 0 |
4 |
|
|
302 |
P1833E
Round Dance
|
0 / 0 |
5 |
|
|
300 |
P1833G
Ksyusha and Chinchilla
|
0 / 0 |
6 |
