Old results of submission #263602

Back to Submissions List View New Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2203. 動態資料結構（Kinetic Data Structure）
4892
9664
Accepted
100

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0~1 範例測資 0 / 0
2 2~8 只有 3 這種運算 7 / 7
3 0~1, 9~15 $NQ \leq 10^ 6$ 10 / 10
4 2~8, 16~22 只有 1 和 3 兩種運算 13 / 13
5 23~29 只有 2 和 3 兩種運算，且保證所有的 , $m_i$ = 1 15 / 15
6 2~8, 23~36 只有 2 和 3 兩種運算 20 / 20
7 0~43 無額外限制 35 / 35

Testdata Results

Testdata no. Subtasks Time (ms) Memory (RSS, KiB) Verdict Score
0 1 3 7 0004.0 8772 Accepted 100
1 1 3 7 0004.0 8836 Accepted 100
2 2 4 6 7 0004.0 8780 Accepted 100
3 2 4 6 7 0004.0 8912 Accepted 100
4 2 4 6 7 0036.0 9608 Accepted 100
5 2 4 6 7 0036.0 9556 Accepted 100
6 2 4 6 7 0036.0 9560 Accepted 100
7 2 4 6 7 0036.0 9580 Accepted 100
8 2 4 6 7 0076.0 9328 Accepted 100
9 3 7 0004.0 8668 Accepted 100
10 3 7 0004.0 8888 Accepted 100
11 3 7 0004.0 8816 Accepted 100
12 3 7 0008.0 8820 Accepted 100
13 3 7 0004.0 8832 Accepted 100
14 3 7 0032.0 8792 Accepted 100
15 3 7 0028.0 9440 Accepted 100
16 4 7 0004.0 8824 Accepted 100
17 4 7 0004.0 8740 Accepted 100
18 4 7 0196.0 9608 Accepted 100
19 4 7 0192.0 9444 Accepted 100
20 4 7 0192.0 9568 Accepted 100
21 4 7 0192.0 9544 Accepted 100
22 4 7 0128.0 9508 Accepted 100
23 5 6 7 0004.0 8804 Accepted 100
24 5 6 7 0008.0 8756 Accepted 100
25 5 6 7 0252.0 9664 Accepted 100
26 5 6 7 0252.0 9560 Accepted 100
27 5 6 7 0252.0 9444 Accepted 100
28 5 6 7 0256.0 9600 Accepted 100
29 5 6 7 0020.0 9424 Accepted 100
30 6 7 0004.0 8724 Accepted 100
31 6 7 0008.0 8672 Accepted 100
32 6 7 0252.0 9628 Accepted 100
33 6 7 0252.0 9580 Accepted 100
34 6 7 0256.0 9620 Accepted 100
35 6 7 0256.0 9556 Accepted 100
36 6 7 0180.0 9388 Accepted 100
37 7 0024.0 8904 Accepted 100
38 7 0292.0 9636 Accepted 100
39 7 0284.0 9444 Accepted 100
40 7 0288.0 9636 Accepted 100
41 7 0288.0 9444 Accepted 100
42 7 0020.0 8868 Accepted 100
43 7 0216.0 9624 Accepted 100
Submitter:
腦子裝咖哩
Compiler:
c++14
Code Length:
4.98 KB
Back to Top