Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

6835
46528
Wrong Answer
0

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0~2 範例測資 0 / 0
2 0~17 $N \le 2000, M \le 2000, Q \le 2000$ 0 / 10
3 18~29 對於每個更改後的所有鹿鹿大遊行(包含修改時間或新增的),皆滿足開始時間 s 與抵達時間 t 相同;且更改後所有鹿鹿大遊行之中,任兩個相異的鹿鹿大遊行的開始時間皆不相同 0 / 30
4 0~38 無額外限制 0 / 60

Testdata Results

Testdata no. Subtasks Time (ms) Memory (VSS, KiB) Memory (RSS, KiB) Verdict Score
0 1 2 4 0020.6 29380 19076 Accepted 100
1 1 2 4 0020.5 29384 19160 Accepted 100
2 1 2 4 0020.1 29380 18952 Accepted 100
3 2 4 0023.3 29384 19188 Accepted 100
4 2 4 0021.5 29380 19136 Wrong Answer 0
5 2 4 0022.9 29384 19252 Accepted 100
6 2 4 0022.9 29380 19132 Wrong Answer 0
7 2 4 0010.7 29380 19040 Wrong Answer 0
8 2 4 0011.5 29380 19016 Wrong Answer 0
9 2 4 0021.6 29384 19140 Accepted 100
10 2 4 0022.9 29380 19112 Wrong Answer 0
11 2 4 0021.2 29384 19028 Accepted 100
12 2 4 0021.3 29380 19140 Accepted 100
13 2 4 0023.5 29384 19172 Accepted 100
14 2 4 0011.7 29380 19148 Accepted 100
15 2 4 0022.7 29380 19144 Accepted 100
16 2 4 0023.0 29380 19100 Accepted 100
17 2 4 0022.5 29380 19176 Accepted 100
18 3 4 0019.7 29384 19096 Accepted 100
19 3 4 0020.8 29384 19076 Accepted 100
20 3 4 0020.9 29380 19100 Accepted 100
21 3 4 0127.9 29384 19132 Wrong Answer 0
22 3 4 0142.7 29380 19108 Accepted 100
23 3 4 0140.8 29384 19092 Accepted 100
24 3 4 0157.2 29512 19508 Accepted 100
25 3 4 0498.6 46016 43828 Wrong Answer 0
26 3 4 0269.1 38356 36216 Wrong Answer 0
27 3 4 0493.2 46012 43972 Wrong Answer 0
28 3 4 0399.5 38620 36656 Wrong Answer 0
29 3 4 0545.0 48652 46528 Wrong Answer 0
30 4 0400.2 34664 32644 Wrong Answer 0
31 4 0299.3 29512 27412 Accepted 100
32 4 0763.2 41128 38956 Wrong Answer 0
33 4 0317.0 36380 34328 Wrong Answer 0
34 4 0318.5 33076 28100 Accepted 100
35 4 0286.1 31760 26920 Accepted 100
36 4 0431.0 34004 31976 Accepted 100
37 4 0433.2 34004 31892 Accepted 100
38 4 0387.4 33076 30884 Accepted 100
Submitter:
Compiler:
c++17
Code Length:
5.69 KB
Back to Top