Back to Submissions List View New Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

28988
3704
Time Limit Exceeded
0

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0~8 每個城市都只有一條航線可以離開,而且每個城市都可以透過搭乘數次飛機航線到達其他所有城市 0 / 9
2 9~19 $N \leq 10,M \leq 20,t \leq 5$ 0 / 14
3 9~30 $t \leq 1000$ 0 / 32
4 0~43 無額外限制 0 / 45

Testdata Results

Testdata no. Subtasks Time (ms) Memory (RSS, KiB) Verdict Score
0 1 4 1972.0 3444 Time Limit Exceeded 0
1 1 4 1972.0 3536 Time Limit Exceeded 0
2 1 4 1980.0 3448 Time Limit Exceeded 0
3 1 4 0448.0 3548 Wrong Answer 0
4 1 4 0552.0 3400 Wrong Answer 0
5 1 4 0520.0 3656 Wrong Answer 0
6 1 4 1968.0 3396 Time Limit Exceeded 0
7 1 4 1980.0 3496 Time Limit Exceeded 0
8 1 4 1984.0 3412 Time Limit Exceeded 0
9 2 3 4 0032.0 3540 Wrong Answer 0
10 2 3 4 0076.0 3480 Wrong Answer 0
11 2 3 4 0032.0 3504 Wrong Answer 0
12 2 3 4 0044.0 3544 Wrong Answer 0
13 2 3 4 0036.0 3392 Wrong Answer 0
14 2 3 4 0044.0 3532 Wrong Answer 0
15 2 3 4 0032.0 3616 Wrong Answer 0
16 2 3 4 0044.0 3424 Wrong Answer 0
17 2 3 4 0044.0 3424 Wrong Answer 0
18 2 3 4 0024.0 3620 Wrong Answer 0
19 2 3 4 0048.0 3704 Wrong Answer 0
20 3 4 0164.0 3464 Wrong Answer 0
21 3 4 0140.0 3540 Wrong Answer 0
22 3 4 0140.0 3408 Wrong Answer 0
23 3 4 0160.0 3544 Wrong Answer 0
24 3 4 0196.0 3508 Wrong Answer 0
25 3 4 0184.0 3464 Wrong Answer 0
26 3 4 0160.0 3496 Wrong Answer 0
27 3 4 0172.0 3488 Wrong Answer 0
28 3 4 0184.0 3608 Wrong Answer 0
29 3 4 0184.0 3704 Wrong Answer 0
30 3 4 0132.0 3544 Wrong Answer 0
31 4 1980.0 3452 Time Limit Exceeded 0
32 4 0480.0 3544 Wrong Answer 0
33 4 1984.0 3440 Time Limit Exceeded 0
34 4 1980.0 3540 Time Limit Exceeded 0
35 4 1980.0 3512 Time Limit Exceeded 0
36 4 0460.0 3476 Wrong Answer 0
37 4 0484.0 3404 Wrong Answer 0
38 4 0472.0 3476 Wrong Answer 0
39 4 0504.0 3512 Wrong Answer 0
40 4 1980.0 3456 Time Limit Exceeded 0
41 4 0140.0 3512 Wrong Answer 0
42 4 0384.0 3544 Wrong Answer 0
43 4 0512.0 3508 Wrong Answer 0
Submitter:
Compiler:
c++14
Code Length:
1.11 KB
Back to Top