Back to Submissions List View New Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

24844
4036
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 1980.0 3552 Time Limit Exceeded 0
1 1 4 1980.0 3916 Time Limit Exceeded 0
2 1 4 1980.0 3548 Time Limit Exceeded 0
3 1 4 0084.0 3408 Wrong Answer 0
4 1 4 0076.0 3592 Wrong Answer 0
5 1 4 0528.0 3876 Wrong Answer 0
6 1 4 1976.0 3768 Time Limit Exceeded 0
7 1 4 1980.0 3684 Time Limit Exceeded 0
8 1 4 1980.0 3016 Time Limit Exceeded 0
9 2 3 4 0000.0 3444 Wrong Answer 0
10 2 3 4 0000.0 3336 Wrong Answer 0
11 2 3 4 0000.0 3320 Wrong Answer 0
12 2 3 4 0000.0 3276 Wrong Answer 0
13 2 3 4 0000.0 3336 Wrong Answer 0
14 2 3 4 0000.0 3268 Wrong Answer 0
15 2 3 4 0000.0 3280 Wrong Answer 0
16 2 3 4 0000.0 3264 Wrong Answer 0
17 2 3 4 0000.0 3260 Wrong Answer 0
18 2 3 4 0000.0 3308 Wrong Answer 0
19 2 3 4 0000.0 3552 Wrong Answer 0
20 3 4 0028.0 3388 Wrong Answer 0
21 3 4 0156.0 3772 Wrong Answer 0
22 3 4 0024.0 3552 Wrong Answer 0
23 3 4 0008.0 3624 Wrong Answer 0
24 3 4 0120.0 3600 Wrong Answer 0
25 3 4 0100.0 3704 Wrong Answer 0
26 3 4 0016.0 3576 Wrong Answer 0
27 3 4 0120.0 3560 Wrong Answer 0
28 3 4 0068.0 3660 Wrong Answer 0
29 3 4 0148.0 3760 Wrong Answer 0
30 3 4 0032.0 3588 Wrong Answer 0
31 4 1976.0 3568 Time Limit Exceeded 0
32 4 0208.0 3640 Wrong Answer 0
33 4 1972.0 3672 Time Limit Exceeded 0
34 4 1988.0 4036 Time Limit Exceeded 0
35 4 1980.0 3652 Time Limit Exceeded 0
36 4 0028.0 3620 Wrong Answer 0
37 4 0072.0 3604 Wrong Answer 0
38 4 0168.0 3672 Wrong Answer 0
39 4 0024.0 3564 Wrong Answer 0
40 4 1980.0 3424 Time Limit Exceeded 0
41 4 0140.0 3780 Wrong Answer 0
42 4 0540.0 3836 Wrong Answer 0
43 4 0384.0 3784 Wrong Answer 0
Submitter:
Compiler:
c++14
Code Length:
1.17 KB
Back to Top