Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

6577
46492
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 0006.1 29384 19124 Accepted 100
1 1 2 4 0020.4 29380 19080 Accepted 100
2 1 2 4 0020.4 29380 19048 Accepted 100
3 2 4 0023.2 29380 19144 Accepted 100
4 2 4 0022.8 29380 19036 Wrong Answer 0
5 2 4 0023.1 29384 19044 Accepted 100
6 2 4 0023.1 29380 19188 Wrong Answer 0
7 2 4 0023.5 29380 19140 Wrong Answer 0
8 2 4 0007.3 29380 19108 Wrong Answer 0
9 2 4 0022.4 29380 19116 Accepted 100
10 2 4 0022.0 29384 19116 Wrong Answer 0
11 2 4 0022.0 29376 19000 Accepted 100
12 2 4 0021.6 29384 19164 Accepted 100
13 2 4 0022.9 29384 19176 Accepted 100
14 2 4 0023.7 29380 19180 Accepted 100
15 2 4 0021.9 29384 19152 Accepted 100
16 2 4 0007.8 29384 19128 Accepted 100
17 2 4 0007.6 29380 19176 Accepted 100
18 3 4 0020.5 29384 19072 Accepted 100
19 3 4 0020.6 29380 19152 Accepted 100
20 3 4 0019.9 29380 18976 Accepted 100
21 3 4 0138.3 29380 18964 Wrong Answer 0
22 3 4 0138.4 29380 19144 Accepted 100
23 3 4 0135.9 29384 19184 Accepted 100
24 3 4 0155.3 29512 19368 Accepted 100
25 3 4 0309.6 46012 43828 Wrong Answer 0
26 3 4 0387.7 38356 36244 Wrong Answer 0
27 3 4 0480.5 46016 43992 Wrong Answer 0
28 3 4 0392.5 38624 36548 Wrong Answer 0
29 3 4 0525.8 48652 46492 Wrong Answer 0
30 4 0394.3 34660 32632 Wrong Answer 0
31 4 0300.1 29512 27420 Accepted 100
32 4 0715.1 41128 39080 Wrong Answer 0
33 4 0294.0 36376 34388 Wrong Answer 0
34 4 0313.6 33076 28196 Accepted 100
35 4 0279.2 31756 26884 Accepted 100
36 4 0427.3 34004 31888 Accepted 100
37 4 0417.9 34004 31948 Accepted 100
38 4 0368.6 33080 30980 Accepted 100
Submitter:
Compiler:
c++17
Code Length:
5.67 KB
Back to Top