Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

6658
46504
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 0021.0 29384 18956 Accepted 100
1 1 2 4 0020.4 29380 19084 Accepted 100
2 1 2 4 0020.1 29380 19164 Accepted 100
3 2 4 0023.0 29384 19172 Accepted 100
4 2 4 0022.8 29380 19236 Wrong Answer 0
5 2 4 0011.3 29380 19112 Accepted 100
6 2 4 0023.0 29380 19136 Wrong Answer 0
7 2 4 0022.8 29380 19180 Wrong Answer 0
8 2 4 0011.5 29384 19148 Wrong Answer 0
9 2 4 0023.8 29384 19224 Accepted 100
10 2 4 0022.0 29384 19080 Wrong Answer 0
11 2 4 0021.9 29380 19044 Accepted 100
12 2 4 0022.5 29380 19004 Accepted 100
13 2 4 0023.6 29384 19168 Accepted 100
14 2 4 0022.5 29380 19164 Accepted 100
15 2 4 0024.4 29384 19144 Accepted 100
16 2 4 0011.7 29380 19192 Accepted 100
17 2 4 0024.4 29380 19180 Accepted 100
18 3 4 0022.5 29384 19132 Accepted 100
19 3 4 0021.6 29380 18976 Accepted 100
20 3 4 0021.4 29380 19184 Accepted 100
21 3 4 0139.9 29384 19172 Wrong Answer 0
22 3 4 0103.2 29380 19192 Accepted 100
23 3 4 0140.2 29380 19084 Accepted 100
24 3 4 0147.4 29512 19508 Accepted 100
25 3 4 0495.2 46016 43828 Wrong Answer 0
26 3 4 0397.7 38356 36244 Wrong Answer 0
27 3 4 0497.5 46016 43972 Wrong Answer 0
28 3 4 0395.2 38624 36520 Wrong Answer 0
29 3 4 0548.0 48648 46504 Wrong Answer 0
30 4 0262.5 34660 32408 Wrong Answer 0
31 4 0296.5 29512 27372 Accepted 100
32 4 0671.6 41132 38960 Wrong Answer 0
33 4 0463.3 36380 34308 Wrong Answer 0
34 4 0309.9 33080 28196 Accepted 100
35 4 0183.9 31752 26948 Accepted 100
36 4 0402.6 34004 31820 Accepted 100
37 4 0403.0 34004 31724 Accepted 100
38 4 0362.1 33080 30824 Accepted 100
Submitter:
Compiler:
c++17
Code Length:
5.58 KB
Back to Top