|
|
1208 |
P1669G
Fall Down
|
0 / 0 |
4 |
|
|
1204 |
P1670C
Where is the Pizza?
|
0 / 0 |
4 |
|
|
1202 |
P1670E
Hemose on the Tree
|
0 / 0 |
8 |
|
|
1188 |
P1672F2
Checker for Array Shuffling
|
0 / 0 |
10 |
|
|
1172 |
P1674G
Remove Directed Edges
|
0 / 0 |
7 |
|
|
1166 |
P1675F
Vlad and Unfinished Business
|
0 / 0 |
6 |
|
|
1158 |
P1676G
White-Black Balanced Subtrees
|
0 / 0 |
4 |
|
|
1153 |
P1677C
Tokitsukaze and Two Colorful Tapes
|
0 / 0 |
6 |
|
|
1143 |
P1679D
Toss a Coin to Your Graph...
|
0 / 0 |
6 |
|
|
1135 |
P1680F
Lenient Vertex Cover
|
0 / 0 |
10 |
|
|
1131 |
P1681D
Required Length
|
0 / 0 |
5 |
|
|
1129 |
P1681F
Unique Occurrences
|
0 / 0 |
8 |
|
|
1124 |
P1682E
Unordered Swaps
|
0 / 0 |
10 |
|
|
1114 |
P1684H
Hard Cut
|
0 / 0 |
10 |
|
|
1107 |
P1685D1
Permutation Weight (Easy Version)
|
0 / 0 |
10 |
|
|
1074 |
P1689C
Infected Tree
|
0 / 0 |
5 |
|
|
1071 |
P1689E
ANDfinity
|
0 / 0 |
9 |
|
|
1057 |
P1691E
Number of Groups
|
0 / 0 |
8 |
|
|
1056 |
P1691F
K-Set Tree
|
0 / 0 |
9 |
|
|
1046 |
P1693B
Fake Plastic Trees
|
0 / 0 |
5 |
|
|
1032 |
P1695D1
Tree Queries (Easy Version)
|
0 / 0 |
8 |
|
|
1030 |
P1695D2
Tree Queries (Hard Version)
|
0 / 0 |
8 |
|
|
1029 |
P1695E
Ambiguous Dominoes
|
0 / 0 |
10 |
|
|
1019 |
P1696F
Tree Recovery
|
0 / 0 |
10 |
|
|
965 |
P1702E
Split Into Two Sets
|
0 / 0 |
5 |
|
|
963 |
P1702G1
Passable Paths (easy version)
|
0 / 0 |
6 |
|
|
962 |
P1702G2
Passable Paths (hard version)
|
0 / 0 |
7 |
|
|
934 |
P1706E
Qpwoeirut and Vertices
|
0 / 0 |
8 |
|
|
931 |
P1707C
DFS Trees
|
0 / 0 |
9 |
|
|
930 |
P1707D
Partial Virtual Trees
|
0 / 0 |
10 |
|
|
921 |
P1709E
XOR Tree
|
0 / 0 |
9 |
|
|
906 |
P1712F
Triameter
|
0 / 0 |
10 |
|
|
893 |
P1714G
Path Prefixes
|
0 / 0 |
5 |
|
|
882 |
P1716E
Swap and Maximum Block
|
0 / 0 |
9 |
|
|
855 |
P1721D
Maximum AND
|
0 / 0 |
6 |
|
|
854 |
P1721E
Prefix Function Queries
|
0 / 0 |
8 |
|
|
853 |
P1721F
Matching Reduction
|
0 / 0 |
10 |
|
|
847 |
P1722F
L-shapes
|
0 / 0 |
5 |
|
|
829 |
P1726D
Edge Split
|
0 / 0 |
7 |
|
|
777 |
P1735C
Phase Shift
|
0 / 0 |
4 |
|
|
755 |
P1738D
Permutation Addicts
|
0 / 0 |
6 |
|
|
743 |
P1739D
Reset K Edges
|
0 / 0 |
6 |
|
|
733 |
P1740E
Hanging Hearts
|
0 / 0 |
6 |
|
|
725 |
P1741D
Masha and a Beautiful Tree
|
0 / 0 |
4 |
|
|
720 |
P1741G
Kirill and Company
|
0 / 0 |
8 |
|
|
673 |
P1746D
Paths on the Tree
|
0 / 0 |
6 |
|
|
639 |
P1749E
Cactus Wall
|
0 / 0 |
9 |
|
|
637 |
P1749F
Distance to the Path
|
0 / 0 |
10 |
|
|
612 |
P1753D
The Beach
|
0 / 0 |
9 |
|
|
595 |
P1758E
Tick, Tock
|
0 / 0 |
9 |
|
|
566 |
P1760G
SlavicG's Favorite Problem
|
0 / 0 |
5 |
|
|
561 |
P1761C
Set Construction
|
0 / 0 |
4 |
|
|
535 |
P1763F
Edge Queries
|
0 / 0 |
10 |
|
|
525 |
P1764F
Doremy's Experimental Tree
|
0 / 0 |
9 |
|
|
469 |
P1768D
Lucky Permutation
|
0 / 0 |
6 |
|
|
458 |
P1770D
Koxia and Game
|
0 / 0 |
7 |
|
|
456 |
P1770E
Koxia and Tree
|
0 / 0 |
9 |
|
|
441 |
P1771D
Hossam and (sub-)palindromic tree
|
0 / 0 |
7 |
|
|
413 |
P1774E
Two Chess Pieces
|
0 / 0 |
6 |
|
|
401 |
P1775D
Friendly Spiders
|
0 / 0 |
6 |
|
|
370 |
P1777D
Score of a Tree
|
0 / 0 |
6 |
|
|
369 |
P1777E
Edge Reverse
|
0 / 0 |
8 |
|
|
360 |
P1778E
The Tree Has Fallen!
|
0 / 0 |
9 |
|
|
358 |
P1778F
Maximizing Root
|
0 / 0 |
10 |
|
|
315 |
P1783F
Double Sort II
|
0 / 0 |
9 |
|
|
299 |
P1787D
Game on Axis
|
0 / 0 |
6 |
|
|
285 |
P1788E
Sum Over Zero
|
0 / 0 |
8 |
|
|
283 |
P1788F
XOR, Tree, and Queries
|
0 / 0 |
9 |
|
|
271 |
P1790F
Timofey and Black-White Tree
|
0 / 0 |
7 |
|
|
269 |
P1790G
Tokens on Graph
|
0 / 0 |
8 |
|
|
251 |
P1792E
Divisors and Table
|
0 / 0 |
9 |
|
|
222 |
P1795F
Blocking Chips
|
0 / 0 |
9 |
|
|
221 |
P1795G
Removal Sequences
|
0 / 0 |
10 |
|
|
213 |
P1796E
Colored Subgraphs
|
0 / 0 |
9 |
|
|
206 |
P1797D
Li Hua and Tree
|
0 / 0 |
6 |
|
|
203 |
P1797F
Li Hua and Path
|
0 / 0 |
10 |
|
|
184 |
P1799E
City Union
|
0 / 0 |
8 |
|
|
180 |
P1799H
Tree Cutting
|
0 / 0 |
10 |
|
|
169 |
P1800E2
Unforgivable Curse (hard version)
|
0 / 0 |
5 |
|
|
166 |
P1800G
Symmetree
|
0 / 0 |
8 |
|
|
145 |
P1804E
Routing
|
0 / 0 |
9 |
|
|
138 |
P1805D
A Wide, Wide Graph
|
0 / 0 |
6 |
|
|
137 |
P1805E
There Should Be a Lot of Maximums
|
0 / 0 |
8 |
|
|
128 |
P1806E
Tree Master
|
0 / 0 |
8 |
|
|
116 |
P1807F
Bouncy Ball
|
0 / 0 |
5 |
|
|
77 |
P1810E
Monsters
|
0 / 0 |
7 |
|
|
61 |
P1811F
Is It Flower?
|
0 / 0 |
7 |
|
|
45 |
P1815C
Between
|
0 / 0 |
8 |
|
|
9801 |
P1817B
Fish Graph
|
0 / 0 |
6 |
|
|
3 |
P1822F
Gardening Friends
|
0 / 0 |
(None) |
|
|
9791 |
P1824C
LuoTianyi and XOR-Tree
|
0 / 0 |
(None) |
|
|
9819 |
P1827D
Two Centroids
|
0 / 0 |
10 |
|
|
9818 |
P1827E
Bus Routes
|
0 / 0 |
10 |
|
|
9772 |
P1829D
Gold Rush
|
0 / 0 |
(None) |
|
|
9771 |
P1829E
The Lakes
|
0 / 0 |
(None) |
|
|
9770 |
P1829F
Forever Winter
|
0 / 0 |
(None) |
|
|
9847 |
P1830A
Copil Copac Draws Trees
|
0 / 0 |
(None) |
|
|
9835 |
P1833E
Round Dance
|
0 / 0 |
5 |
|
|
9833 |
P1833G
Ksyusha and Chinchilla
|
0 / 0 |
6 |
|
|
9936 |
P1835D
Doctor's Brown Hypothesis
|
0 / 0 |
10 |
