1717朱宇炜 |
|
10: NOIP2014D2T2寻找道路 |
Accepted |
10 |
7944kB |
144ms |
1481 B |
G++ |
昨天 |
nfxc |
|
05: 3.2.6Sweet Butter 香甜的黄油 |
Accepted |
10 |
368kB |
453ms |
1108 B |
G++ |
昨天 |
long_long_int |
|
02: [模版]单源最短路dijkstra-邻接表 |
Accepted |
10 |
22808kB |
1435ms |
1135 B |
G++ |
6天前 |
long_long_int |
|
02: [模版]单源最短路dijkstra-邻接表 |
Wrong Answer |
4 |
22680kB |
1370ms |
1198 B |
G++ |
6天前 |
long_long_int |
|
02: [模版]单源最短路dijkstra-邻接表 |
Wrong Answer |
4 |
22808kB |
1421ms |
1171 B |
G++ |
6天前 |
long_long_int |
|
02: [模版]单源最短路dijkstra-邻接表 |
Wrong Answer |
4 |
22436kB |
1351ms |
1069 B |
G++ |
6天前 |
long_long_int |
|
02: [模版]单源最短路dijkstra-邻接表 |
Wrong Answer |
0 |
22428kB |
1339ms |
1065 B |
G++ |
6天前 |
long_long_int |
|
02: [模版]单源最短路dijkstra-邻接表 |
Wrong Answer |
4 |
140000kB |
2000ms |
613 B |
G++ |
6天前 |
long_long_int |
|
02: [模版]单源最短路dijkstra-邻接表 |
Wrong Answer |
2 |
140000kB |
2000ms |
591 B |
G++ |
6天前 |
long_long_int |
|
03: [模版]最小生成树MST |
Accepted |
10 |
7368kB |
292ms |
774 B |
G++ |
6天前 |
long_long_int |
|
01: 图的深度优先遍历(邻接矩阵存储) |
Accepted |
10 |
128kB |
1ms |
436 B |
G++ |
6天前 |
HaoDaDaDa |
|
09: 烦人的幻灯片问题 |
Accepted |
3 |
144kB |
4ms |
4361 B |
G++ |
18.1.15 |
HaoDaDaDa |
|
09: 烦人的幻灯片问题 |
Wrong Answer |
2 |
144kB |
2ms |
4284 B |
G++ |
18.1.14 |
nfxc |
|
06: 3.3.1Riding the Fences骑马修栅栏 |
Accepted |
8 |
1208kB |
4ms |
511 B |
G++ |
18.1.14 |
nfxc |
|
02: [模版]单源最短路dijkstra-邻接表 |
Accepted |
10 |
23576kB |
1060ms |
857 B |
G++ |
18.1.14 |