|
|
867 |
P1648D Serious Business
|
0 / 0 |
10 |
|
|
866 |
P1648E Air Reform
|
0 / 0 |
10 |
|
|
865 |
P1648F Two Avenues
|
0 / 0 |
10 |
|
|
858 |
P1650E Rescheduling the Exam
|
0 / 0 |
省选/NOI- |
|
|
856 |
P1650G Counting Shortcuts
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
853 |
P1651C Fault-tolerant Network
|
0 / 0 |
提高+/省选- |
|
|
852 |
P1651D Nearest Excluded Points
|
0 / 0 |
省选/NOI- |
|
|
850 |
P1651F Tower Defense
|
0 / 0 |
10 |
|
|
847 |
P1654C Alice and the Cake
|
0 / 0 |
普及+/提高 |
|
|
845 |
P1654E Arithmetic Operations
|
0 / 0 |
8 |
|
|
844 |
P1654F Minimal String Xoration
|
0 / 0 |
10 |
|
|
843 |
P1654G Snowy Mountain
|
0 / 0 |
10 |
|
|
840 |
P1656B Subtract Operation
|
0 / 0 |
普及/提高- |
|
|
834 |
P1656H Equal LCM Subsets
|
0 / 0 |
10 |
|
|
822 |
P1658D2 388535 (Hard Version)
|
0 / 0 |
8 |
|
|
821 |
P1658E Gojou and Matrix Game
|
0 / 0 |
9 |
|
|
816 |
P1659D Reverse Sort Sum
|
0 / 0 |
省选/NOI- |
|
|
807 |
P1660F2 Promising String (hard version)
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
803 |
P1661D Progressions Covering
|
0 / 0 |
省选/NOI- |
|
|
802 |
P1661E Narrow Components
|
0 / 0 |
9 |
|
|
795 |
P1662F Antennas
|
0 / 0 |
暂无评定 |
|
|
789 |
P1662L Il Derby della Madonnina
|
0 / 0 |
暂无评定 |
|
|
773 |
P1665E MinimizOR
|
0 / 0 |
9 |
|
|
759 |
P1667B Optimal Partition
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
748 |
P1669E 2-Letter Strings
|
0 / 0 |
普及+/提高 |
|
|
747 |
P1669F Eating Candies
|
0 / 0 |
普及/提高- |
|
|
742 |
P1670C Where is the Pizza?
|
0 / 0 |
普及+/提高 |
|
|
724 |
P1672H Zigu Zagu
|
0 / 0 |
10 |
|
|
723 |
P1672I PermutationForces
|
0 / 0 |
10 |
|
|
711 |
P1674F Desktop Rearrangement
|
0 / 0 |
省选/NOI- |
|
|
697 |
P1676F Longest Strike
|
0 / 0 |
普及+/提高 |
|
|
694 |
P1676H2 Maximum Crossings (Hard Version)
|
0 / 0 |
提高+/省选- |
|
|
693 |
P1677A Tokitsukaze and Strange Inequality
|
0 / 0 |
提高+/省选- |
|
|
692 |
P1677B Tokitsukaze and Meeting
|
0 / 0 |
提高+/省选- |
|
|
689 |
P1677E Tokitsukaze and Beautiful Subsegments
|
0 / 0 |
10 |
|
|
683 |
P1679B Stone Age Problem
|
0 / 0 |
普及+/提高 |
|
|
682 |
P1679C Rooks Defenders
|
0 / 0 |
普及+/提高 |
|
|
668 |
P1681E Labyrinth Adventures
|
0 / 0 |
10 |
|
|
667 |
P1681F Unique Occurrences
|
0 / 0 |
8 |
|
|
661 |
P1682F MCMF?
|
0 / 0 |
10 |
|
|
656 |
P1684E MEX vs DIFF
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
655 |
P1684F Diverse Segments
|
0 / 0 |
10 |
|
|
647 |
P1685E The Ultimate LIS Problem
|
0 / 0 |
10 |
|
|
642 |
P1687C Sanae and Giant Robot
|
0 / 0 |
9 |
|
|
641 |
P1687D Cute number
|
0 / 0 |
10 |
|
|
634 |
P1689B Mystic Permutation
|
0 / 0 |
普及/提高- |
|
|
632 |
P1689D Lena and Matrix
|
0 / 0 |
省选/NOI- |
|
|
628 |
P1690C Restoring the Duration of Tasks
|
0 / 0 |
普及/提高- |
|
|
624 |
P1690G Count the Trains
|
0 / 0 |
NOI/NOI+/CTSC |
|
|
620 |
P1691D Max GEQ Sum
|
0 / 0 |
省选/NOI- |
