|
|
3098 |
P1214E
Petya and Construction Set
|
0 / 0 |
7 |
|
|
3095 |
P1214H
Tiles Placement
|
0 / 0 |
10 |
|
|
3076 |
P1217F
Forced Online Queries Problem
|
0 / 0 |
10 |
|
|
3060 |
P1220E
Tourism
|
0 / 0 |
8 |
|
|
3046 |
P1223E
Paint the Tree
|
0 / 0 |
7 |
|
|
3037 |
P1225F
Tree Factory
|
0 / 0 |
9 |
|
|
3021 |
P1228F
One Node is Gone
|
0 / 0 |
9 |
|
|
2989 |
P1238F
The Maximum Subtree
|
0 / 0 |
8 |
|
|
2969 |
P1244D
Paint the Tree
|
0 / 0 |
6 |
|
|
2962 |
P1245D
Shichikuji and Power Grid
|
0 / 0 |
6 |
|
|
2947 |
P1249F
Maximum Weight Subset
|
0 / 0 |
8 |
|
|
2924 |
P1252B
Cleaning Robots
|
0 / 0 |
8 |
|
|
2922 |
P1252D
Find String in a Grid
|
0 / 0 |
10 |
|
|
2920 |
P1252F
Regular Forestation
|
0 / 0 |
9 |
|
|
2908 |
P1253F
Cheap Robot
|
0 / 0 |
9 |
|
|
2903 |
P1254D
Tree Queries
|
0 / 0 |
10 |
|
|
2902 |
P1254E
Send Tree to Charlie
|
0 / 0 |
10 |
|
|
2880 |
P1260F
Colored Tree
|
0 / 0 |
10 |
|
|
2811 |
P1276D
Tree Elimination
|
0 / 0 |
10 |
|
|
2802 |
P1278D
Segment Tree
|
0 / 0 |
7 |
|
|
2801 |
P1278E
Tests for problem D
|
0 / 0 |
8 |
|
|
2791 |
P1280C
Jeremy Bearimy
|
0 / 0 |
7 |
|
|
2790 |
P1280D
Miss Punyverse
|
0 / 0 |
9 |
|
|
2774 |
P1283F
DIY Garland
|
0 / 0 |
8 |
|
|
2768 |
P1284F
New Year and Social Network
|
0 / 0 |
10 |
|
|
2763 |
P1285D
Dr
|
0 / 0 |
6 |
|
|
2762 |
P1285E
Delete a Segment
|
0 / 0 |
8 |
|
|
2759 |
P1286B
Numbers on Tree
|
0 / 0 |
6 |
|
|
2734 |
P1292C
Xenon's Attack on the Gangs
|
0 / 0 |
8 |
|
|
2733 |
P1292D
Chaotic V.
|
0 / 0 |
10 |
|
|
2723 |
P1294F
Three Paths on a Tree
|
0 / 0 |
7 |
|
|
2710 |
P1296F
Berland Beauty
|
0 / 0 |
7 |
|
|
2705 |
P1297E
Modernization of Treeland
|
0 / 0 |
(无) |
|
|
2697 |
P1299D
Around the World
|
0 / 0 |
10 |
|
|
2671 |
P1303G
Sum of Prefix Sums
|
0 / 0 |
10 |
|
|
2666 |
P1304E
1-Trees and Queries
|
0 / 0 |
7 |
|
|
2660 |
P1305D
Kuroni and the Celebration
|
0 / 0 |
6 |
|
|
2650 |
P1307F
Cow and Vacation
|
0 / 0 |
10 |
|
|
2638 |
P1311E
Construct the Binary Tree
|
0 / 0 |
8 |
|
|
2610 |
P1320E
Treeland and Viruses
|
0 / 0 |
10 |
|
|
2601 |
P1322F
Assigning Fares
|
0 / 0 |
10 |
|
|
2593 |
P1324F
Maximum White Subtree
|
0 / 0 |
6 |
|
|
2590 |
P1325C
Ehab and Path-etic MEXs
|
0 / 0 |
5 |
|
|
2578 |
P1326G
Spiderweb Trees
|
0 / 0 |
10 |
|
|
2566 |
P1328E
Tree Queries
|
0 / 0 |
6 |
|
|
2544 |
P1332F
Independent Set
|
0 / 0 |
9 |
|
|
2522 |
P1336A
Linova and Kingdom
|
0 / 0 |
5 |
|
|
2516 |
P1336F
Journey
|
0 / 0 |
10 |
|
|
2512 |
P1338B
Edge Weight Assignment
|
0 / 0 |
6 |
|
|
2510 |
P1338D
Nested Rubber Bands
|
0 / 0 |
10 |
|
|
2503 |
P1340D
Nastya and Time Machine
|
0 / 0 |
10 |
|
|
2482 |
P1344E
Train Tracks
|
0 / 0 |
10 |
|
|
2373 |
P1361D
Johnny and James
|
0 / 0 |
10 |
|
|
2372 |
P1361E
James and the Chase
|
0 / 0 |
10 |
|
|
2365 |
P1363C
Game On Leaves
|
0 / 0 |
5 |
|
|
2363 |
P1363E
Tree Shuffling
|
0 / 0 |
7 |
|
|
2358 |
P1364D
Ehab's Last Corollary
|
0 / 0 |
7 |
|
|
2329 |
P1368G
Shifting Dominoes
|
0 / 0 |
10 |
|
|
2323 |
P1369D
TediousLee
|
0 / 0 |
6 |
|
|
2315 |
P1370F1
The Hidden Pair (Easy Version)
|
0 / 0 |
9 |
|
|
2314 |
P1370F2
The Hidden Pair (Hard Version)
|
0 / 0 |
10 |
|
|
2280 |
P1375G
Tree Modification
|
0 / 0 |
10 |
|
|
2273 |
P1379E
Inverse Genealogy
|
0 / 0 |
10 |
|
|
2266 |
P1380E
Merging Towers
|
0 / 0 |
8 |
|
|
2259 |
P1381D
The Majestic Brown Tree Snake
|
0 / 0 |
10 |
|
|
2255 |
P1383A
String Transformation 1
|
0 / 0 |
5 |
|
|
2253 |
P1383C
String Transformation 2
|
0 / 0 |
10 |
|
|
2241 |
P1385F
Removing Leaves
|
0 / 0 |
8 |
|
|
2235 |
P1387B1
Village (Minimum)
|
0 / 0 |
7 |
|
|
2234 |
P1387B2
Village (Maximum)
|
0 / 0 |
9 |
|
|
2230 |
P1388C
Uncle Bogdan and Country Happiness
|
0 / 0 |
6 |
|
|
2229 |
P1388D
Captain Flint and Treasure
|
0 / 0 |
7 |
|
|
2221 |
P1389G
Directing Edges
|
0 / 0 |
10 |
|
|
2216 |
P1391E
Pairs of Pairs
|
0 / 0 |
10 |
|
|
2197 |
P1394D
Boboniu and Jianghu
|
0 / 0 |
10 |
|
|
2188 |
P1396E
Distance Matching
|
0 / 0 |
10 |
|
|
2174 |
P1399E1
Weights Division (easy version)
|
0 / 0 |
7 |
|
|
2173 |
P1399E2
Weights Division (hard version)
|
0 / 0 |
8 |
|
|
2161 |
P1401D
Maximum Distributed Tree
|
0 / 0 |
6 |
|
|
2156 |
P1402C
Star Trek
|
0 / 0 |
10 |
|
|
2154 |
P1403B
Spring cleaning
|
0 / 0 |
8 |
|
|
2151 |
P1404B
Tree Tag
|
0 / 0 |
6 |
|
|
2143 |
P1406C
Link Cut Centroids
|
0 / 0 |
5 |
|
|
2131 |
P1408E
Avoid Rainbow Cycles
|
0 / 0 |
9 |
|
|
2129 |
P1408G
Clusterization Counting
|
0 / 0 |
10 |
|
|
2108 |
P1413F
Roads and Ramen
|
0 / 0 |
10 |
|
|
2099 |
P1416C
XOR Inverse
|
0 / 0 |
7 |
|
|
2098 |
P1416D
Graph and Queries
|
0 / 0 |
10 |
|
|
2060 |
P1423C
Dušan's Railway
|
0 / 0 |
10 |
|
|
2027 |
P1427F
Boring Card Game
|
0 / 0 |
10 |
|
|
1987 |
P1436D
Bandit in a City
|
0 / 0 |
6 |
|
|
1981 |
P1437D
Minimal Height Tree
|
0 / 0 |
5 |
|
|
1978 |
P1437G
Death DBMS
|
0 / 0 |
10 |
|
|
1972 |
P1438F
Olha and Igor
|
0 / 0 |
10 |
|
|
1966 |
P1439E
Cheat and Win
|
0 / 0 |
10 |
|
|
1959 |
P1442E
Black, White and Grey Tree
|
0 / 0 |
10 |
|
|
1949 |
P1444E
Finding the Vertex
|
0 / 0 |
10 |
|
|
1944 |
P1446C
Xor Tree
|
0 / 0 |
7 |
|
|
1930 |
P1450G
Communism
|
0 / 0 |
10 |
|
|
1914 |
P1452G
Game On Tree
|
0 / 0 |
10 |
