Old results of submission #294484

Back to Submissions List View New Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2196. D. 乘車時間
2804
13200
Wrong Answer
0

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0~9 $n\leq 500$ 0 / 16
2 10~19 對於所有的 $i=1,2\dots,n-1$，皆有 $p_i=1$。 0 / 31
3 20~29 對於所有的 $i=1,2,\dots,n-1$，皆有 $u_i=i, v_i=i+1$。 0 / 37
4 0~44 無額外限制。 0 / 16

Testdata Results

Testdata no. Subtasks Time (ms) Memory (RSS, KiB) Verdict Score
0 1 4 0000.0 4480 Wrong Answer 0
1 1 4 0000.0 4572 Wrong Answer 0
2 1 4 0000.0 4552 Wrong Answer 0
3 1 4 0000.0 4448 Wrong Answer 0
4 1 4 0000.0 4312 Wrong Answer 0
5 1 4 0004.0 4420 Wrong Answer 0
6 1 4 0000.0 4352 Wrong Answer 0
7 1 4 0000.0 4588 Wrong Answer 0
8 1 4 0004.0 4564 Wrong Answer 0
9 1 4 0000.0 4484 Wrong Answer 0
10 2 4 0084.0 9408 Wrong Answer 0
11 2 4 0104.0 11080 Wrong Answer 0
12 2 4 0108.0 10888 Wrong Answer 0
13 2 4 0056.0 7948 Wrong Answer 0
14 2 4 0048.0 7316 Wrong Answer 0
15 2 4 0064.0 8492 Wrong Answer 0
16 2 4 0096.0 9996 Wrong Answer 0
17 2 4 0064.0 8360 Wrong Answer 0
18 2 4 0076.0 9084 Wrong Answer 0
19 2 4 0084.0 9712 Wrong Answer 0
20 3 4 0076.0 10196 Wrong Answer 0
21 3 4 0052.0 8724 Wrong Answer 0
22 3 4 0104.0 13200 Wrong Answer 0
23 3 4 0096.0 12172 Wrong Answer 0
24 3 4 0092.0 11956 Wrong Answer 0
25 3 4 0044.0 7960 Wrong Answer 0
26 3 4 0080.0 10904 Wrong Answer 0
27 3 4 0076.0 10824 Wrong Answer 0
28 3 4 0104.0 13052 Wrong Answer 0
29 3 4 0080.0 10868 Wrong Answer 0
30 4 0064.0 8204 Wrong Answer 0
31 4 0108.0 11176 Wrong Answer 0
32 4 0096.0 10404 Wrong Answer 0
33 4 0060.0 7800 Wrong Answer 0
34 4 0084.0 9952 Wrong Answer 0
35 4 0068.0 8380 Wrong Answer 0
36 4 0108.0 10608 Wrong Answer 0
37 4 0104.0 11072 Wrong Answer 0
38 4 0092.0 10004 Wrong Answer 0
39 4 0072.0 8640 Wrong Answer 0
40 4 0076.0 9196 Wrong Answer 0
41 4 0084.0 9668 Wrong Answer 0
42 4 0060.0 8116 Wrong Answer 0
43 4 0064.0 8684 Wrong Answer 0
44 4 0068.0 8760 Wrong Answer 0
Submitter:
Wayne Yan
Compiler:
c++14
Code Length:
2.01 KB
Back to Top