题目 |
用户 |
结果 |
得分 |
语言 |
用时 |
内存 |
提交时间 |
找最佳通路 搜索法
图论
最短路
★☆ |
ondelett |
AAAAAAAAAA |
100 |
C++ |
0.003 s |
0.32 MiB |
2012-09-28 10:57:39 |
线段覆盖 线段树
★★ |
111 |
AAAAAAAAAEEEEE |
64 |
C++ |
1.213 s |
13.43 MiB |
2012-09-28 10:50:23 |
线段覆盖 线段树
★★ |
111 |
AAAAAAAAAEEEEE |
64 |
C++ |
0.678 s |
8.71 MiB |
2012-09-28 10:49:25 |
线段覆盖 线段树
★★ |
111 |
RRRRRRTTTEEEEE |
0 |
C++ |
6.429 s |
10.30 MiB |
2012-09-28 10:49:10 |
线段覆盖 线段树
★★ |
111 |
EEEEEEEEEEEEEE |
0 |
C++ |
0.000 s |
0.00 MiB |
2012-09-28 10:48:50 |
双服务点设置 图论
最短路
★☆ |
ondelett |
AAAAAAAA |
100 |
C++ |
0.009 s |
0.36 MiB |
2012-09-28 10:46:05 |
线段覆盖 线段树
★★ |
111 |
AAAAAATTTTTTTT |
42 |
C++ |
17.382 s |
13.14 MiB |
2012-09-28 10:43:36 |
双服务点设置 图论
最短路
★☆ |
ondelett |
AAAAAAEE |
75 |
C++ |
0.362 s |
0.34 MiB |
2012-09-28 10:41:05 |
线段覆盖 线段树
★★ |
111 |
AAAAAATTTTTTTT |
42 |
C++ |
17.390 s |
13.15 MiB |
2012-09-28 10:38:52 |
线段覆盖 线段树
★★ |
111 |
AAAAAAAAAAAAAA |
100 |
C++ |
1.649 s |
14.24 MiB |
2012-09-28 10:37:44 |
线段覆盖 线段树
★★ |
111 |
EEEEEEEEEEEEEE |
0 |
C++ |
1.139 s |
15.34 MiB |
2012-09-28 10:36:23 |
双服务点设置 图论
最短路
★☆ |
ondelett |
AAAAAAEE |
75 |
C++ |
0.366 s |
0.34 MiB |
2012-09-28 10:33:28 |
线段覆盖 线段树
★★ |
111 |
AAAAAAAAAEEEEE |
64 |
C++ |
0.665 s |
8.71 MiB |
2012-09-28 10:07:24 |
线段覆盖 线段树
★★ |
111 |
EEEEEEEEEEEEEE |
0 |
C++ |
0.000 s |
0.00 MiB |
2012-09-28 10:06:50 |
[NOIP 2005]篝火晚会 图论
NOIP/CSP
群论
★★☆ |
QhelDIV |
AAAAAAAAAA |
100 |
C++ |
0.106 s |
1.75 MiB |
2012-09-28 10:04:02 |
服务点设置 图论
最短路
★ |
ondelett |
AAAAAAAA |
100 |
C++ |
0.008 s |
0.32 MiB |
2012-09-28 10:01:07 |
[NOIP 2005]篝火晚会 图论
NOIP/CSP
群论
★★☆ |
QhelDIV |
AAAAWAAWAA |
80 |
C++ |
0.127 s |
4.69 MiB |
2012-09-28 10:01:00 |
单子序列最大和 贪心
前缀和
★ |
digital-T |
AAAAAAAAAA |
100 |
Pascal |
0.058 s |
5.88 MiB |
2012-09-28 09:56:07 |
线段覆盖 线段树
★★ |
111 |
AAAAAAAAAEEEEE |
64 |
C++ |
1.183 s |
17.42 MiB |
2012-09-28 09:55:12 |
线段覆盖 线段树
★★ |
111 |
AAAAAAAAAEEEEE |
64 |
C++ |
1.171 s |
18.23 MiB |
2012-09-28 09:52:09 |