Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

6714
46392
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.1 29384 19052 Accepted 100
1 1 2 4 0022.7 29384 19048 Accepted 100
2 1 2 4 0019.7 29380 19084 Accepted 100
3 2 4 0023.3 29380 19252 Accepted 100
4 2 4 0022.3 29380 19040 Wrong Answer 0
5 2 4 0023.4 29380 19112 Accepted 100
6 2 4 0022.7 29384 19036 Wrong Answer 0
7 2 4 0010.7 29380 19144 Wrong Answer 0
8 2 4 0010.5 29384 19244 Wrong Answer 0
9 2 4 0022.6 29380 19136 Accepted 100
10 2 4 0021.2 29380 19144 Wrong Answer 0
11 2 4 0021.7 29380 19140 Accepted 100
12 2 4 0022.1 29384 19180 Accepted 100
13 2 4 0024.8 29380 19068 Accepted 100
14 2 4 0022.7 29380 19160 Accepted 100
15 2 4 0011.9 29380 19248 Accepted 100
16 2 4 0022.1 29384 19196 Accepted 100
17 2 4 0023.9 29380 19104 Accepted 100
18 3 4 0022.7 29380 19060 Accepted 100
19 3 4 0012.5 29380 18976 Accepted 100
20 3 4 0021.2 29380 19136 Accepted 100
21 3 4 0144.1 29380 19112 Wrong Answer 0
22 3 4 0141.9 29384 19128 Accepted 100
23 3 4 0139.3 29384 19056 Accepted 100
24 3 4 0159.1 29512 19324 Accepted 100
25 3 4 0495.1 46016 43932 Wrong Answer 0
26 3 4 0392.4 38352 36248 Wrong Answer 0
27 3 4 0495.1 46016 43936 Wrong Answer 0
28 3 4 0266.5 38620 36520 Wrong Answer 0
29 3 4 0548.5 48656 46392 Wrong Answer 0
30 4 0404.2 34664 32596 Wrong Answer 0
31 4 0297.4 29516 27384 Accepted 100
32 4 0759.3 41132 39144 Wrong Answer 0
33 4 0486.5 36376 34248 Wrong Answer 0
34 4 0211.6 33072 28192 Accepted 100
35 4 0280.3 31760 26820 Accepted 100
36 4 0415.5 34000 31936 Accepted 100
37 4 0276.3 34004 31876 Accepted 100
38 4 0375.7 33080 31000 Accepted 100
Submitter:
Compiler:
c++17
Code Length:
5.66 KB
Back to Top