|
|
2817 |
P1214E
Petya and Construction Set
|
0 / 0 |
7 |
|
|
2814 |
P1214H
Tiles Placement
|
0 / 0 |
10 |
|
|
2795 |
P1217F
Forced Online Queries Problem
|
0 / 0 |
10 |
|
|
2779 |
P1220E
Tourism
|
0 / 0 |
8 |
|
|
2765 |
P1223E
Paint the Tree
|
0 / 0 |
7 |
|
|
2756 |
P1225F
Tree Factory
|
0 / 0 |
9 |
|
|
2740 |
P1228F
One Node is Gone
|
0 / 0 |
9 |
|
|
2708 |
P1238F
The Maximum Subtree
|
0 / 0 |
8 |
|
|
2688 |
P1244D
Paint the Tree
|
0 / 0 |
6 |
|
|
2681 |
P1245D
Shichikuji and Power Grid
|
0 / 0 |
6 |
|
|
2666 |
P1249F
Maximum Weight Subset
|
0 / 0 |
8 |
|
|
2643 |
P1252B
Cleaning Robots
|
0 / 0 |
8 |
|
|
2641 |
P1252D
Find String in a Grid
|
0 / 0 |
10 |
|
|
2639 |
P1252F
Regular Forestation
|
0 / 0 |
9 |
|
|
2627 |
P1253F
Cheap Robot
|
0 / 0 |
9 |
|
|
2622 |
P1254D
Tree Queries
|
0 / 0 |
10 |
|
|
2621 |
P1254E
Send Tree to Charlie
|
0 / 0 |
10 |
|
|
2599 |
P1260F
Colored Tree
|
0 / 0 |
10 |
|
|
2592 |
P1263F
Economic Difficulties
|
0 / 0 |
9 |
|
|
2530 |
P1276D
Tree Elimination
|
0 / 0 |
10 |
|
|
2521 |
P1278D
Segment Tree
|
0 / 0 |
7 |
|
|
2520 |
P1278E
Tests for problem D
|
0 / 0 |
8 |
|
|
2510 |
P1280C
Jeremy Bearimy
|
0 / 0 |
7 |
|
|
2509 |
P1280D
Miss Punyverse
|
0 / 0 |
9 |
|
|
2493 |
P1283F
DIY Garland
|
0 / 0 |
8 |
|
|
2487 |
P1284F
New Year and Social Network
|
0 / 0 |
10 |
|
|
2482 |
P1285D
Dr
|
0 / 0 |
6 |
|
|
2481 |
P1285E
Delete a Segment
|
0 / 0 |
8 |
|
|
2478 |
P1286B
Numbers on Tree
|
0 / 0 |
6 |
|
|
2453 |
P1292C
Xenon's Attack on the Gangs
|
0 / 0 |
8 |
|
|
2452 |
P1292D
Chaotic V.
|
0 / 0 |
10 |
|
|
2442 |
P1294F
Three Paths on a Tree
|
0 / 0 |
7 |
|
|
2429 |
P1296F
Berland Beauty
|
0 / 0 |
7 |
|
|
2424 |
P1297E
Modernization of Treeland
|
0 / 0 |
(无) |
|
|
2416 |
P1299D
Around the World
|
0 / 0 |
10 |
|
|
2390 |
P1303G
Sum of Prefix Sums
|
0 / 0 |
10 |
|
|
2385 |
P1304E
1-Trees and Queries
|
0 / 0 |
7 |
|
|
2379 |
P1305D
Kuroni and the Celebration
|
0 / 0 |
6 |
|
|
2369 |
P1307F
Cow and Vacation
|
0 / 0 |
10 |
|
|
2357 |
P1311E
Construct the Binary Tree
|
0 / 0 |
8 |
|
|
2329 |
P1320E
Treeland and Viruses
|
0 / 0 |
10 |
|
|
2320 |
P1322F
Assigning Fares
|
0 / 0 |
10 |
|
|
2312 |
P1324F
Maximum White Subtree
|
0 / 0 |
6 |
|
|
2309 |
P1325C
Ehab and Path-etic MEXs
|
0 / 0 |
5 |
|
|
2297 |
P1326G
Spiderweb Trees
|
0 / 0 |
10 |
|
|
2285 |
P1328E
Tree Queries
|
0 / 0 |
6 |
|
|
2263 |
P1332F
Independent Set
|
0 / 0 |
9 |
|
|
2241 |
P1336A
Linova and Kingdom
|
0 / 0 |
5 |
|
|
2235 |
P1336F
Journey
|
0 / 0 |
10 |
|
|
2231 |
P1338B
Edge Weight Assignment
|
0 / 0 |
6 |
|
|
2229 |
P1338D
Nested Rubber Bands
|
0 / 0 |
10 |
|
|
2222 |
P1340D
Nastya and Time Machine
|
0 / 0 |
10 |
|
|
2201 |
P1344E
Train Tracks
|
0 / 0 |
10 |
|
|
2092 |
P1361D
Johnny and James
|
0 / 0 |
10 |
|
|
2091 |
P1361E
James and the Chase
|
0 / 0 |
10 |
|
|
2084 |
P1363C
Game On Leaves
|
0 / 0 |
5 |
|
|
2082 |
P1363E
Tree Shuffling
|
0 / 0 |
7 |
|
|
2077 |
P1364D
Ehab's Last Corollary
|
0 / 0 |
7 |
|
|
2048 |
P1368G
Shifting Dominoes
|
0 / 0 |
10 |
|
|
2042 |
P1369D
TediousLee
|
0 / 0 |
6 |
|
|
2034 |
P1370F1
The Hidden Pair (Easy Version)
|
0 / 0 |
9 |
|
|
2033 |
P1370F2
The Hidden Pair (Hard Version)
|
0 / 0 |
10 |
|
|
1999 |
P1375G
Tree Modification
|
0 / 0 |
10 |
|
|
1992 |
P1379E
Inverse Genealogy
|
0 / 0 |
10 |
|
|
1985 |
P1380E
Merging Towers
|
0 / 0 |
8 |
|
|
1978 |
P1381D
The Majestic Brown Tree Snake
|
0 / 0 |
10 |
|
|
1974 |
P1383A
String Transformation 1
|
0 / 0 |
5 |
|
|
1972 |
P1383C
String Transformation 2
|
0 / 0 |
10 |
|
|
1960 |
P1385F
Removing Leaves
|
0 / 0 |
8 |
|
|
1954 |
P1387B1
Village (Minimum)
|
0 / 0 |
7 |
|
|
1953 |
P1387B2
Village (Maximum)
|
0 / 0 |
9 |
|
|
1949 |
P1388C
Uncle Bogdan and Country Happiness
|
0 / 0 |
6 |
|
|
1948 |
P1388D
Captain Flint and Treasure
|
0 / 0 |
7 |
|
|
1940 |
P1389G
Directing Edges
|
0 / 0 |
10 |
|
|
1935 |
P1391E
Pairs of Pairs
|
0 / 0 |
10 |
|
|
1916 |
P1394D
Boboniu and Jianghu
|
0 / 0 |
10 |
|
|
1907 |
P1396E
Distance Matching
|
0 / 0 |
10 |
|
|
1893 |
P1399E1
Weights Division (easy version)
|
0 / 0 |
7 |
|
|
1892 |
P1399E2
Weights Division (hard version)
|
0 / 0 |
8 |
|
|
1880 |
P1401D
Maximum Distributed Tree
|
0 / 0 |
6 |
|
|
1875 |
P1402C
Star Trek
|
0 / 0 |
10 |
|
|
1873 |
P1403B
Spring cleaning
|
0 / 0 |
8 |
|
|
1870 |
P1404B
Tree Tag
|
0 / 0 |
6 |
|
|
1862 |
P1406C
Link Cut Centroids
|
0 / 0 |
5 |
|
|
1850 |
P1408E
Avoid Rainbow Cycles
|
0 / 0 |
9 |
|
|
1848 |
P1408G
Clusterization Counting
|
0 / 0 |
10 |
|
|
1827 |
P1413F
Roads and Ramen
|
0 / 0 |
10 |
|
|
1818 |
P1416C
XOR Inverse
|
0 / 0 |
7 |
|
|
1817 |
P1416D
Graph and Queries
|
0 / 0 |
10 |
|
|
1779 |
P1423C
Dušan's Railway
|
0 / 0 |
10 |
|
|
1746 |
P1427F
Boring Card Game
|
0 / 0 |
10 |
|
|
1706 |
P1436D
Bandit in a City
|
0 / 0 |
6 |
|
|
1700 |
P1437D
Minimal Height Tree
|
0 / 0 |
5 |
|
|
1697 |
P1437G
Death DBMS
|
0 / 0 |
10 |
|
|
1691 |
P1438F
Olha and Igor
|
0 / 0 |
10 |
|
|
1685 |
P1439E
Cheat and Win
|
0 / 0 |
10 |
|
|
1678 |
P1442E
Black, White and Grey Tree
|
0 / 0 |
10 |
|
|
1668 |
P1444E
Finding the Vertex
|
0 / 0 |
10 |
|
|
1663 |
P1446C
Xor Tree
|
0 / 0 |
7 |
|
|
1649 |
P1450G
Communism
|
0 / 0 |
10 |
