|
|
258 |
MPIGS
Sell Pigs
|
0 / 0 |
(无) |
|
|
1 |
1
火车进出栈问题
|
0 / 4 |
10 |
|
|
3 |
P2
火车进栈
|
5 / 11 |
9 |
|
|
8 |
P3
Largest Rectangle in a Histogram
|
1 / 7 |
10 |
|
|
6 |
6
蚯蚓
|
2 / 29 |
9 |
|
|
7 |
7
邻值查找
|
2 / 8 |
10 |
|
|
9 |
9
表达式检验
|
7 / 20 |
8 |
|
|
12 |
12
[NOIP2008-提高] 双栈排序
|
1 / 4 |
10 |
|
|
15 |
15
双端队列
|
1 / 6 |
10 |
|
|
16 |
16
Team Queue
|
4 / 11 |
9 |
|
|
291 |
P16E
Fish
|
0 / 0 |
(无) |
|
|
17 |
17
PA2014 Final Bazarek
|
4 / 58 |
9 |
|
|
18 |
18
「BZOJ3668」「NOI2014」起床困难综合症
|
3 / 7 |
10 |
|
|
19 |
19
「JLOI2015」装备购买
|
1 / 5 |
10 |
|
|
20 |
20
「HEOI2015」兔子与樱花
|
0 / 0 |
(无) |
|
|
21 |
21
「BZOJ2563」「国家集训队」阿狸和桃子的游戏
|
1 / 2 |
10 |
|
|
22 |
22
[POI2007]砝码Odw
|
1 / 1 |
10 |
|
|
23 |
23
[Poi2003]Chocolate
|
1 / 1 |
10 |
|
|
24 |
24
PA2014Final Zarowki
|
0 / 0 |
(无) |
|
|
25 |
25
[POI2005]sam-Toy Cars
|
2 / 6 |
10 |
|
|
26 |
26
[JSOI2007]建筑抢修
|
2 / 3 |
10 |
|
|
27 |
27
[Poi2012] Warehouse Store
|
3 / 14 |
9 |
|
|
28 |
28
[CTSC2007]数据备份
|
0 / 0 |
(无) |
|
|
29 |
29
[BeiJing2011] 元素
|
1 / 5 |
10 |
|
|
30 |
30
[HNOI2009]通往城堡之路
|
0 / 0 |
(无) |
|
|
31 |
31
「模板」单源最短路
|
12 / 48 |
7 |
|
|
32 |
32
农场派对
|
6 / 6 |
10 |
|
|
33 |
33
「模板」次短路
|
6 / 24 |
8 |
|
|
34 |
34
架设电话线
|
4 / 10 |
9 |
|
|
35 |
35
「NOIP2009」最优贸易
|
2 / 4 |
10 |
|
|
36 |
36
道路和航线
|
3 / 10 |
10 |
|
|
37 |
37
2763. [JLOI2011]飞行路线
|
1 / 1 |
10 |
|
|
38 |
38
1003. [ZJOI2006]物流运输
|
0 / 0 |
(无) |
|
|
39 |
39
「GXOI / GZOI2019」旅行者
|
0 / 0 |
(无) |
|
|
40 |
40
2750. [HAOI2012]Road
|
0 / 0 |
(无) |
|
|
42 |
42
「模板」K短路 / [SDOI2010]魔法猪学院
|
0 / 0 |
(无) |
|
|
43 |
43
2304. [APIO2011]寻路
|
0 / 0 |
(无) |
|
|
44 |
44
1922. [SDOI2010]大陆争霸
|
0 / 0 |
(无) |
|
|
45 |
45
2151. [国家集训队] 种树
|
1 / 4 |
10 |
|
|
46 |
46
3174. [Tjoi2013]拯救小矮人
|
0 / 0 |
(无) |
|
|
47 |
47
1218. [HNOI2003]激光炸弹
|
2 / 5 |
10 |
|
|
48 |
48
1303. [CQOI2009]中位数图
|
2 / 10 |
10 |
|
|
49 |
49
2901. 矩阵求和
|
1 / 4 |
10 |
|
|
50 |
50
IncDec Sequence
|
1 / 5 |
10 |
|
|
52 |
52
1676. [Usaco2005 Feb]Feed Accounting 饲料计算
|
1 / 3 |
10 |
|
|
53 |
53
「NOIP2015」跳石头
|
0 / 0 |
(无) |
|
|
54 |
54
Best Cow Fences
|
0 / 0 |
(无) |
|
|
55 |
55
「NOIP2011」聪明的质监员
|
0 / 0 |
(无) |
|
|
281 |
P55D
Beautiful numbers
|
0 / 0 |
(无) |
|
|
56 |
56
「NOIP2012」借教室
|
0 / 0 |
(无) |
|
|
57 |
57
4590. [SHOI2015]自动刷题机
|
0 / 0 |
(无) |
|
|
58 |
58
1816. [CQOI2010]扑克牌
|
0 / 0 |
(无) |
|
|
59 |
59
防线（秦腾与教学评估）
|
0 / 0 |
(无) |
|
|
60 |
60
1052. [HAOI2007]覆盖问题
|
0 / 0 |
(无) |
|
|
61 |
61
Sunscreen
|
0 / 0 |
(无) |
|
|
62 |
62
Radar Installation
|
0 / 0 |
(无) |
|
|
63 |
63
国王游戏
|
0 / 0 |
(无) |
|
|
65 |
65
一元三次方程求解
|
0 / 0 |
(无) |
|
|
66 |
66
最小生成树
|
3 / 10 |
10 |
|
|
67 |
67
秘密的牛奶运输
|
0 / 0 |
(无) |
|
|
68 |
68
Tree
|
1 / 5 |
10 |
|
|
69 |
69
北极通讯网络
|
2 / 4 |
10 |
|
|
70 |
70
走廊泼水节
|
1 / 1 |
10 |
|
|
71 |
71
「Picnic Planning」 野餐规划
|
0 / 0 |
(无) |
|
|
72 |
72
黑暗城堡
|
0 / 0 |
(无) |
|
|
73 |
73
黑暗城堡
|
0 / 0 |
(无) |
|
|
74 |
74
最小生成树计数
|
0 / 1 |
10 |
|
|
75 |
75
「NOIP2013」货车运输
|
1 / 1 |
10 |
|
|
76 |
76
1821. [JSOI2010]Group 部落划分 Group
|
1 / 1 |
10 |
|
|
79 |
79
1731. [Usaco2005 dec]Layout 排队布局
|
1 / 1 |
10 |
|
|
80 |
80
2120. 数颜色
|
0 / 0 |
(无) |
|
|
81 |
81
4562. [HAOI2016]食物链
|
10 / 30 |
6 |
|
|
82 |
82
1124. [POI2008]枪战Maf
|
2 / 18 |
9 |
|
|
83 |
83
神经网络
|
4 / 9 |
9 |
|
|
84 |
84
[NOIP2013-普及]车站分级
|
1 / 1 |
10 |
|
|
85 |
85
4010. [HNOI2015]菜肴制作
|
5 / 10 |
9 |
|
|
86 |
86
欧拉回路
|
1 / 7 |
10 |
|
|
87 |
87
拯救大兵瑞恩
|
0 / 0 |
(无) |
|
|
89 |
89
Cow Relays
|
2 / 2 |
10 |
|
|
90 |
90
Hide-And-Seek Game
|
0 / 0 |
(无) |
|
|
91 |
91
Alice Game
|
0 / 0 |
(无) |
|
|
92 |
92
Binary Number
|
0 / 0 |
(无) |
|
|
93 |
93
Conuter Strike
|
0 / 0 |
(无) |
|
|
94 |
94
Card Game
|
0 / 0 |
(无) |
|
|
95 |
95
Or
|
0 / 0 |
(无) |
|
|
96 |
96
Fencing the cows
|
0 / 0 |
(无) |
|
|
97 |
97
foreverlasting and fried-chicken
|
0 / 0 |
(无) |
|
|
98 |
98
Hello World 3 Pro Max
|
0 / 0 |
(无) |
|
|
99 |
99
String Problem
|
0 / 0 |
(无) |
|
|
100 |
100
Klee likes making friends
|
0 / 0 |
(无) |
|
|
101 |
101
SPY finding NPY
|
0 / 0 |
(无) |
|
|
102 |
102
Coin
|
0 / 0 |
(无) |
|
|
103 |
103
Turret
|
0 / 0 |
(无) |
|
|
104 |
104
最大流
|
2 / 2 |
10 |
|
|
105 |
105
最小费用流
|
1 / 1 |
10 |
|
|
106 |
106
无源汇有上下界可行流
|
0 / 4 |
10 |
|
|
107 |
107
有源汇有上下界最大流
|
1 / 2 |
10 |
|
|
108 |
108
有源汇有上下界最小流
|
0 / 1 |
10 |
|
|
109 |
109
「模板」单源最短路
|
0 / 0 |
(无) |
|
|
110 |
110
「离线可过」动态图连通性
|
0 / 0 |
(无) |
