|
|
4058 |
P1214E
Petya and Construction Set
|
0 / 0 |
7 |
|
|
4055 |
P1214H
Tiles Placement
|
0 / 0 |
10 |
|
|
4036 |
P1217F
Forced Online Queries Problem
|
0 / 0 |
10 |
|
|
4020 |
P1220E
Tourism
|
0 / 0 |
8 |
|
|
4006 |
P1223E
Paint the Tree
|
0 / 0 |
7 |
|
|
3997 |
P1225F
Tree Factory
|
0 / 0 |
9 |
|
|
3981 |
P1228F
One Node is Gone
|
0 / 0 |
9 |
|
|
3949 |
P1238F
The Maximum Subtree
|
0 / 0 |
8 |
|
|
3929 |
P1244D
Paint the Tree
|
0 / 0 |
6 |
|
|
3922 |
P1245D
Shichikuji and Power Grid
|
0 / 0 |
6 |
|
|
3907 |
P1249F
Maximum Weight Subset
|
0 / 0 |
8 |
|
|
3884 |
P1252B
Cleaning Robots
|
0 / 0 |
8 |
|
|
3882 |
P1252D
Find String in a Grid
|
0 / 0 |
10 |
|
|
3880 |
P1252F
Regular Forestation
|
0 / 0 |
9 |
|
|
3868 |
P1253F
Cheap Robot
|
0 / 0 |
9 |
|
|
3863 |
P1254D
Tree Queries
|
0 / 0 |
10 |
|
|
3862 |
P1254E
Send Tree to Charlie
|
0 / 0 |
10 |
|
|
3840 |
P1260F
Colored Tree
|
0 / 0 |
10 |
|
|
3833 |
P1263F
Economic Difficulties
|
0 / 0 |
9 |
|
|
3771 |
P1276D
Tree Elimination
|
0 / 0 |
10 |
|
|
3762 |
P1278D
Segment Tree
|
0 / 0 |
7 |
|
|
3761 |
P1278E
Tests for problem D
|
0 / 0 |
8 |
|
|
3751 |
P1280C
Jeremy Bearimy
|
0 / 0 |
7 |
|
|
3750 |
P1280D
Miss Punyverse
|
0 / 0 |
9 |
|
|
3734 |
P1283F
DIY Garland
|
0 / 0 |
8 |
|
|
3728 |
P1284F
New Year and Social Network
|
0 / 0 |
10 |
|
|
3723 |
P1285D
Dr
|
0 / 0 |
6 |
|
|
3722 |
P1285E
Delete a Segment
|
0 / 0 |
8 |
|
|
3719 |
P1286B
Numbers on Tree
|
0 / 0 |
6 |
|
|
3694 |
P1292C
Xenon's Attack on the Gangs
|
0 / 0 |
8 |
|
|
3693 |
P1292D
Chaotic V.
|
0 / 0 |
10 |
|
|
3683 |
P1294F
Three Paths on a Tree
|
0 / 0 |
7 |
|
|
3670 |
P1296F
Berland Beauty
|
0 / 0 |
7 |
|
|
3665 |
P1297E
Modernization of Treeland
|
0 / 0 |
(无) |
|
|
3657 |
P1299D
Around the World
|
0 / 0 |
10 |
|
|
3631 |
P1303G
Sum of Prefix Sums
|
0 / 0 |
10 |
|
|
3626 |
P1304E
1-Trees and Queries
|
0 / 0 |
7 |
|
|
3620 |
P1305D
Kuroni and the Celebration
|
0 / 0 |
6 |
|
|
3610 |
P1307F
Cow and Vacation
|
0 / 0 |
10 |
|
|
3598 |
P1311E
Construct the Binary Tree
|
0 / 0 |
8 |
|
|
3570 |
P1320E
Treeland and Viruses
|
0 / 1 |
10 |
|
|
3561 |
P1322F
Assigning Fares
|
0 / 0 |
10 |
|
|
3553 |
P1324F
Maximum White Subtree
|
0 / 0 |
6 |
|
|
3550 |
P1325C
Ehab and Path-etic MEXs
|
0 / 0 |
5 |
|
|
3538 |
P1326G
Spiderweb Trees
|
0 / 0 |
10 |
|
|
3526 |
P1328E
Tree Queries
|
0 / 0 |
6 |
|
|
3504 |
P1332F
Independent Set
|
0 / 0 |
9 |
|
|
3482 |
P1336A
Linova and Kingdom
|
0 / 0 |
5 |
|
|
3476 |
P1336F
Journey
|
0 / 0 |
10 |
|
|
3472 |
P1338B
Edge Weight Assignment
|
0 / 0 |
6 |
|
|
3470 |
P1338D
Nested Rubber Bands
|
0 / 0 |
10 |
|
|
3463 |
P1340D
Nastya and Time Machine
|
0 / 0 |
10 |
|
|
3442 |
P1344E
Train Tracks
|
0 / 0 |
10 |
|
|
3333 |
P1361D
Johnny and James
|
0 / 0 |
10 |
|
|
3332 |
P1361E
James and the Chase
|
0 / 0 |
10 |
|
|
3325 |
P1363C
Game On Leaves
|
0 / 0 |
5 |
|
|
3323 |
P1363E
Tree Shuffling
|
0 / 0 |
7 |
|
|
3318 |
P1364D
Ehab's Last Corollary
|
0 / 0 |
7 |
|
|
3289 |
P1368G
Shifting Dominoes
|
0 / 0 |
10 |
|
|
3283 |
P1369D
TediousLee
|
0 / 0 |
6 |
|
|
3275 |
P1370F1
The Hidden Pair (Easy Version)
|
0 / 0 |
9 |
|
|
3274 |
P1370F2
The Hidden Pair (Hard Version)
|
0 / 0 |
10 |
|
|
3240 |
P1375G
Tree Modification
|
0 / 0 |
10 |
|
|
3233 |
P1379E
Inverse Genealogy
|
0 / 0 |
10 |
|
|
3226 |
P1380E
Merging Towers
|
0 / 0 |
8 |
|
|
3219 |
P1381D
The Majestic Brown Tree Snake
|
0 / 0 |
10 |
|
|
3215 |
P1383A
String Transformation 1
|
0 / 0 |
5 |
|
|
3213 |
P1383C
String Transformation 2
|
0 / 0 |
10 |
|
|
3201 |
P1385F
Removing Leaves
|
0 / 0 |
8 |
|
|
3195 |
P1387B1
Village (Minimum)
|
0 / 0 |
7 |
|
|
3194 |
P1387B2
Village (Maximum)
|
0 / 0 |
9 |
|
|
3190 |
P1388C
Uncle Bogdan and Country Happiness
|
0 / 0 |
6 |
|
|
3189 |
P1388D
Captain Flint and Treasure
|
0 / 0 |
7 |
|
|
3181 |
P1389G
Directing Edges
|
0 / 0 |
10 |
|
|
3176 |
P1391E
Pairs of Pairs
|
0 / 0 |
10 |
|
|
3157 |
P1394D
Boboniu and Jianghu
|
0 / 0 |
10 |
|
|
3148 |
P1396E
Distance Matching
|
0 / 0 |
10 |
|
|
3134 |
P1399E1
Weights Division (easy version)
|
0 / 0 |
7 |
|
|
3133 |
P1399E2
Weights Division (hard version)
|
0 / 0 |
8 |
|
|
3121 |
P1401D
Maximum Distributed Tree
|
0 / 0 |
6 |
|
|
3116 |
P1402C
Star Trek
|
0 / 0 |
10 |
|
|
3114 |
P1403B
Spring cleaning
|
0 / 0 |
8 |
|
|
3111 |
P1404B
Tree Tag
|
0 / 0 |
6 |
|
|
3103 |
P1406C
Link Cut Centroids
|
0 / 0 |
5 |
|
|
3091 |
P1408E
Avoid Rainbow Cycles
|
0 / 0 |
9 |
|
|
3089 |
P1408G
Clusterization Counting
|
0 / 0 |
10 |
|
|
3068 |
P1413F
Roads and Ramen
|
0 / 0 |
10 |
|
|
3059 |
P1416C
XOR Inverse
|
0 / 0 |
7 |
|
|
3058 |
P1416D
Graph and Queries
|
0 / 0 |
10 |
|
|
3020 |
P1423C
Dušan's Railway
|
0 / 0 |
10 |
|
|
2987 |
P1427F
Boring Card Game
|
0 / 0 |
10 |
|
|
2947 |
P1436D
Bandit in a City
|
0 / 0 |
6 |
|
|
2941 |
P1437D
Minimal Height Tree
|
0 / 0 |
5 |
|
|
2938 |
P1437G
Death DBMS
|
0 / 0 |
10 |
|
|
2932 |
P1438F
Olha and Igor
|
0 / 0 |
10 |
|
|
2926 |
P1439E
Cheat and Win
|
0 / 0 |
10 |
|
|
2919 |
P1442E
Black, White and Grey Tree
|
0 / 0 |
10 |
|
|
2909 |
P1444E
Finding the Vertex
|
0 / 0 |
10 |
|
|
2904 |
P1446C
Xor Tree
|
0 / 0 |
7 |
|
|
2890 |
P1450G
Communism
|
0 / 0 |
10 |
