|
|
4221 |
P1214E
Petya and Construction Set
|
0 / 0 |
7 |
|
|
4218 |
P1214H
Tiles Placement
|
0 / 0 |
10 |
|
|
4199 |
P1217F
Forced Online Queries Problem
|
0 / 0 |
10 |
|
|
4183 |
P1220E
Tourism
|
0 / 0 |
8 |
|
|
4169 |
P1223E
Paint the Tree
|
0 / 0 |
7 |
|
|
4160 |
P1225F
Tree Factory
|
0 / 0 |
9 |
|
|
4144 |
P1228F
One Node is Gone
|
0 / 0 |
9 |
|
|
4112 |
P1238F
The Maximum Subtree
|
0 / 0 |
8 |
|
|
4092 |
P1244D
Paint the Tree
|
0 / 0 |
6 |
|
|
4085 |
P1245D
Shichikuji and Power Grid
|
1 / 1 |
6 |
|
|
4070 |
P1249F
Maximum Weight Subset
|
0 / 0 |
8 |
|
|
4041 |
P1252B
Cleaning Robots
|
0 / 0 |
8 |
|
|
4037 |
P1252D
Find String in a Grid
|
0 / 0 |
10 |
|
|
4033 |
P1252F
Regular Forestation
|
0 / 0 |
9 |
|
|
4010 |
P1253F
Cheap Robot
|
0 / 0 |
9 |
|
|
4000 |
P1254D
Tree Queries
|
0 / 0 |
10 |
|
|
3997 |
P1254E
Send Tree to Charlie
|
0 / 0 |
10 |
|
|
3953 |
P1260F
Colored Tree
|
0 / 0 |
10 |
|
|
3940 |
P1263F
Economic Difficulties
|
0 / 0 |
9 |
|
|
3817 |
P1276D
Tree Elimination
|
0 / 0 |
10 |
|
|
3800 |
P1278D
Segment Tree
|
0 / 0 |
7 |
|
|
3798 |
P1278E
Tests for problem D
|
0 / 0 |
8 |
|
|
3777 |
P1280C
Jeremy Bearimy
|
0 / 0 |
7 |
|
|
3775 |
P1280D
Miss Punyverse
|
1 / 1 |
9 |
|
|
3747 |
P1283F
DIY Garland
|
0 / 0 |
8 |
|
|
3740 |
P1284F
New Year and Social Network
|
0 / 0 |
10 |
|
|
3732 |
P1285D
Dr
|
0 / 0 |
6 |
|
|
3729 |
P1285E
Delete a Segment
|
0 / 0 |
8 |
|
|
3723 |
P1286B
Numbers on Tree
|
0 / 0 |
6 |
|
|
3680 |
P1292C
Xenon's Attack on the Gangs
|
0 / 0 |
8 |
|
|
3679 |
P1292D
Chaotic V.
|
0 / 0 |
10 |
|
|
3666 |
P1294F
Three Paths on a Tree
|
0 / 0 |
7 |
|
|
3642 |
P1296F
Berland Beauty
|
0 / 0 |
7 |
|
|
3625 |
P1297E
Modernization of Treeland
|
0 / 0 |
(None) |
|
|
3617 |
P1299D
Around the World
|
0 / 0 |
10 |
|
|
3591 |
P1303G
Sum of Prefix Sums
|
0 / 0 |
10 |
|
|
3586 |
P1304E
1-Trees and Queries
|
0 / 0 |
7 |
|
|
3580 |
P1305D
Kuroni and the Celebration
|
0 / 0 |
6 |
|
|
3570 |
P1307F
Cow and Vacation
|
0 / 0 |
10 |
|
|
3547 |
P1311E
Construct the Binary Tree
|
0 / 0 |
8 |
|
|
3503 |
P1320E
Treeland and Viruses
|
0 / 0 |
10 |
|
|
3487 |
P1322F
Assigning Fares
|
0 / 0 |
10 |
|
|
3476 |
P1324F
Maximum White Subtree
|
0 / 0 |
6 |
|
|
3473 |
P1325C
Ehab and Path-etic MEXs
|
0 / 0 |
5 |
|
|
3452 |
P1326G
Spiderweb Trees
|
0 / 0 |
10 |
|
|
3433 |
P1328E
Tree Queries
|
0 / 0 |
6 |
|
|
3393 |
P1332F
Independent Set
|
0 / 0 |
9 |
|
|
3361 |
P1336A
Linova and Kingdom
|
0 / 0 |
5 |
|
|
3355 |
P1336F
Journey
|
0 / 0 |
10 |
|
|
3351 |
P1338B
Edge Weight Assignment
|
0 / 0 |
6 |
|
|
3349 |
P1338D
Nested Rubber Bands
|
0 / 0 |
10 |
|
|
3342 |
P1340D
Nastya and Time Machine
|
0 / 0 |
10 |
|
|
3321 |
P1344E
Train Tracks
|
0 / 0 |
10 |
|
|
3212 |
P1361D
Johnny and James
|
0 / 0 |
10 |
|
|
3211 |
P1361E
James and the Chase
|
0 / 0 |
10 |
|
|
3204 |
P1363C
Game On Leaves
|
0 / 0 |
5 |
|
|
3202 |
P1363E
Tree Shuffling
|
0 / 0 |
7 |
|
|
3197 |
P1364D
Ehab's Last Corollary
|
1 / 1 |
7 |
|
|
3168 |
P1368G
Shifting Dominoes
|
0 / 0 |
10 |
|
|
3162 |
P1369D
TediousLee
|
0 / 0 |
6 |
|
|
3154 |
P1370F1
The Hidden Pair (Easy Version)
|
0 / 0 |
9 |
|
|
3153 |
P1370F2
The Hidden Pair (Hard Version)
|
0 / 0 |
10 |
|
|
3119 |
P1375G
Tree Modification
|
0 / 0 |
10 |
|
|
3112 |
P1379E
Inverse Genealogy
|
0 / 0 |
10 |
|
|
3105 |
P1380E
Merging Towers
|
0 / 0 |
8 |
|
|
3098 |
P1381D
The Majestic Brown Tree Snake
|
0 / 0 |
10 |
|
|
3094 |
P1383A
String Transformation 1
|
0 / 0 |
5 |
|
|
3092 |
P1383C
String Transformation 2
|
0 / 0 |
10 |
|
|
3080 |
P1385F
Removing Leaves
|
0 / 0 |
8 |
|
|
3074 |
P1387B1
Village (Minimum)
|
0 / 0 |
7 |
|
|
3073 |
P1387B2
Village (Maximum)
|
0 / 0 |
9 |
|
|
3069 |
P1388C
Uncle Bogdan and Country Happiness
|
0 / 0 |
6 |
|
|
3068 |
P1388D
Captain Flint and Treasure
|
0 / 0 |
7 |
|
|
3060 |
P1389G
Directing Edges
|
0 / 0 |
10 |
|
|
3055 |
P1391E
Pairs of Pairs
|
0 / 0 |
10 |
|
|
3036 |
P1394D
Boboniu and Jianghu
|
1 / 3 |
10 |
|
|
3027 |
P1396E
Distance Matching
|
0 / 0 |
10 |
|
|
3013 |
P1399E1
Weights Division (easy version)
|
0 / 0 |
7 |
|
|
3012 |
P1399E2
Weights Division (hard version)
|
0 / 0 |
8 |
|
|
3000 |
P1401D
Maximum Distributed Tree
|
0 / 0 |
6 |
|
|
2995 |
P1402C
Star Trek
|
0 / 0 |
10 |
|
|
2993 |
P1403B
Spring cleaning
|
0 / 0 |
8 |
|
|
2990 |
P1404B
Tree Tag
|
0 / 0 |
6 |
|
|
2982 |
P1406C
Link Cut Centroids
|
0 / 0 |
5 |
|
|
2970 |
P1408E
Avoid Rainbow Cycles
|
0 / 0 |
9 |
|
|
2968 |
P1408G
Clusterization Counting
|
0 / 0 |
10 |
|
|
2947 |
P1413F
Roads and Ramen
|
0 / 0 |
10 |
|
|
2938 |
P1416C
XOR Inverse
|
0 / 0 |
7 |
|
|
2937 |
P1416D
Graph and Queries
|
0 / 0 |
10 |
|
|
2899 |
P1423C
Dušan's Railway
|
0 / 0 |
10 |
|
|
2866 |
P1427F
Boring Card Game
|
0 / 0 |
10 |
|
|
2826 |
P1436D
Bandit in a City
|
0 / 0 |
6 |
|
|
2820 |
P1437D
Minimal Height Tree
|
0 / 0 |
5 |
|
|
2817 |
P1437G
Death DBMS
|
0 / 0 |
10 |
|
|
2811 |
P1438F
Olha and Igor
|
0 / 0 |
10 |
|
|
2805 |
P1439E
Cheat and Win
|
0 / 0 |
10 |
|
|
2798 |
P1442E
Black, White and Grey Tree
|
0 / 0 |
10 |
|
|
2788 |
P1444E
Finding the Vertex
|
0 / 0 |
10 |
|
|
2783 |
P1446C
Xor Tree
|
0 / 0 |
7 |
|
|
2769 |
P1450G
Communism
|
0 / 0 |
10 |
