Old results of submission #263615

Back to Submissions List View New Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2203. 動態資料結構（Kinetic Data Structure）
8724
9696
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 8800 Accepted 100
1 1 3 7 0004.0 8884 Accepted 100
2 2 4 6 7 0004.0 8664 Accepted 100
3 2 4 6 7 0008.0 8900 Accepted 100
4 2 4 6 7 0088.0 9584 Accepted 100
5 2 4 6 7 0080.0 9656 Accepted 100
6 2 4 6 7 0064.0 9552 Accepted 100
7 2 4 6 7 0064.0 9540 Accepted 100
8 2 4 6 7 0268.0 9344 Accepted 100
9 3 7 0004.0 8912 Accepted 100
10 3 7 0008.0 8868 Accepted 100
11 3 7 0008.0 8676 Accepted 100
12 3 7 0012.0 8836 Accepted 100
13 3 7 0008.0 8892 Accepted 100
14 3 7 0036.0 8892 Accepted 100
15 3 7 0028.0 9652 Accepted 100
16 4 7 0004.0 8816 Accepted 100
17 4 7 0008.0 8884 Accepted 100
18 4 7 0444.0 9648 Accepted 100
19 4 7 0444.0 9516 Accepted 100
20 4 7 0428.0 9664 Accepted 100
21 4 7 0424.0 9580 Accepted 100
22 4 7 0264.0 9480 Accepted 100
23 5 6 7 0004.0 8780 Accepted 100
24 5 6 7 0008.0 8788 Accepted 100
25 5 6 7 0424.0 9572 Accepted 100
26 5 6 7 0420.0 9632 Accepted 100
27 5 6 7 0416.0 9636 Accepted 100
28 5 6 7 0424.0 9604 Accepted 100
29 5 6 7 0024.0 9316 Accepted 100
30 6 7 0004.0 8740 Accepted 100
31 6 7 0008.0 8800 Accepted 100
32 6 7 0428.0 9552 Accepted 100
33 6 7 0436.0 9576 Accepted 100
34 6 7 0420.0 9660 Accepted 100
35 6 7 0424.0 9440 Accepted 100
36 6 7 0296.0 9280 Accepted 100
37 7 0036.0 8924 Accepted 100
38 7 0448.0 9616 Accepted 100
39 7 0460.0 9696 Accepted 100
40 7 0448.0 9580 Accepted 100
41 7 0440.0 9620 Accepted 100
42 7 0036.0 8848 Accepted 100
43 7 0416.0 9556 Accepted 100
Submitter:
腦子裝咖哩
Compiler:
c++14
Code Length:
4.37 KB
Back to Top