|
|
2196 |
P1391E Pairs of Pairs
|
0 / 0 |
10 |
|
|
2187 |
P1392I Kevin and Grid
|
0 / 0 |
10 |
|
|
2179 |
P1394B Boboniu Walks on Graph
|
0 / 0 |
8 |
|
|
2152 |
P1399F Yet Another Segments Subset
|
0 / 0 |
8 |
|
|
2136 |
P1402C Star Trek
|
0 / 0 |
10 |
|
|
2135 |
P1403A The Potion of Great Power
|
0 / 0 |
9 |
|
|
2134 |
P1403B Spring cleaning
|
0 / 0 |
8 |
|
|
2128 |
P1404E Bricks
|
0 / 0 |
10 |
|
|
2123 |
P1406C Link Cut Centroids
|
0 / 0 |
提高+/省选- |
|
|
2117 |
P1407D Discrete Centrifugal Jumps
|
0 / 0 |
8 |
|
|
2116 |
P1407E Egor in the Republic of Dagestan
|
0 / 0 |
9 |
|
|
2111 |
P1408E Avoid Rainbow Cycles
|
0 / 0 |
9 |
|
|
2109 |
P1408G Clusterization Counting
|
0 / 0 |
10 |
|
|
2098 |
P1411C Peaceful Rooks
|
0 / 0 |
提高+/省选- |
|
|
2078 |
P1416D Graph and Queries
|
0 / 0 |
10 |
|
|
2071 |
P1418C Mortal Kombat Tower
|
0 / 0 |
提高+/省选- |
|
|
2060 |
P1419F Rain of Fire
|
0 / 0 |
10 |
|
|
2045 |
P1422D Returning Home
|
0 / 0 |
8 |
|
|
2041 |
P1423B Valuable Paper
|
0 / 0 |
省选/NOI- |
|
|
2040 |
P1423C Dušan's Railway
|
0 / 0 |
10 |
|
|
2035 |
P1423H Virus
|
0 / 0 |
9 |
|
|
2027 |
P1424M Ancient Language
|
0 / 0 |
8 |
|
|
2006 |
P1427G One Billion Shades of Grey
|
0 / 0 |
10 |
|
|
2003 |
P1428B Belted Rooms
|
0 / 0 |
普及+/提高 |
|
|
1989 |
P1430G Yet Another DAG Problem
|
0 / 0 |
10 |
|
|
1972 |
P1433G Reducing Delivery Cost
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1967 |
P1436D Bandit in a City
|
0 / 0 |
省选/NOI- |
|
|
1961 |
P1437D Minimal Height Tree
|
0 / 0 |
提高+/省选- |
|
|
1950 |
P1439A2 Binary Table (Hard Version)
|
0 / 0 |
省选/NOI- |
|
|
1949 |
P1439B Graph Subset Problem
|
0 / 0 |
10 |
|
|
1941 |
P1442C Graph Transpositions
|
0 / 0 |
9 |
|
|
1931 |
P1444C Team-Building
|
0 / 0 |
9 |
|
|
1912 |
P1450E Capitalism
|
0 / 0 |
10 |
|
|
1883 |
P1454E Number of Simple Paths
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1870 |
P1458D Flip and Reverse
|
0 / 0 |
10 |
|
|
1861 |
P1461E Water Level
|
0 / 0 |
8 |
|
|
1848 |
P1463E Plan of Lectures
|
0 / 0 |
9 |
|
|
1840 |
P1466F Euclid's nightmare
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1838 |
P1466H Finding satisfactory solutions
|
0 / 0 |
10 |
|
|
1822 |
P1468J Road Reform
|
0 / 0 |
省选/NOI- |
|
|
1819 |
P1468M Similar Sets
|
0 / 0 |
8 |
|
|
1810 |
P1470B Strange Definition
|
0 / 0 |
省选/NOI- |
|
|
1808 |
P1470D Strange Housing
|
0 / 0 |
8 |
|
|
1807 |
P1470E Strange Permutation
|
0 / 0 |
10 |
|
|
1801 |
P1472C Long Jumps
|
0 / 0 |
普及/提高- |
|
|
1797 |
P1472G Moving to the Capital
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
1792 |
P1473E Minimum Path
|
0 / 0 |
9 |
|
|
1781 |
P1475C Ball in Berland
|
0 / 0 |
普及+/提高 |
|
|
1774 |
P1476C Longest Simple Cycle
|
0 / 0 |
提高+/省选- |
|
|
1772 |
P1476E Pattern Matching
|
0 / 0 |
8 |
