Old results of submission #273630

Back to Submissions List View New Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2203. 動態資料結構（Kinetic Data Structure）
5952
8456
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 0000.0 1248 Accepted 100
1 1 3 7 0000.0 1276 Accepted 100
2 2 4 6 7 0000.0 1192 Accepted 100
3 2 4 6 7 0000.0 1256 Accepted 100
4 2 4 6 7 0036.0 8400 Accepted 100
5 2 4 6 7 0036.0 8376 Accepted 100
6 2 4 6 7 0036.0 8456 Accepted 100
7 2 4 6 7 0036.0 8376 Accepted 100
8 2 4 6 7 0140.0 8348 Accepted 100
9 3 7 0000.0 1248 Accepted 100
10 3 7 0000.0 1292 Accepted 100
11 3 7 0000.0 1240 Accepted 100
12 3 7 0004.0 1280 Accepted 100
13 3 7 0000.0 1676 Accepted 100
14 3 7 0008.0 1196 Accepted 100
15 3 7 0012.0 6948 Accepted 100
16 4 7 0000.0 1204 Accepted 100
17 4 7 0000.0 1256 Accepted 100
18 4 7 0304.0 8360 Accepted 100
19 4 7 0308.0 8364 Accepted 100
20 4 7 0304.0 8364 Accepted 100
21 4 7 0300.0 8372 Accepted 100
22 4 7 0184.0 8364 Accepted 100
23 5 6 7 0000.0 1188 Accepted 100
24 5 6 7 0004.0 1324 Accepted 100
25 5 6 7 0292.0 8368 Accepted 100
26 5 6 7 0292.0 8400 Accepted 100
27 5 6 7 0320.0 8404 Accepted 100
28 5 6 7 0308.0 8404 Accepted 100
29 5 6 7 0016.0 8348 Accepted 100
30 6 7 0000.0 1208 Accepted 100
31 6 7 0004.0 1260 Accepted 100
32 6 7 0308.0 8400 Accepted 100
33 6 7 0296.0 8360 Accepted 100
34 6 7 0292.0 8364 Accepted 100
35 6 7 0296.0 8440 Accepted 100
36 6 7 0200.0 8360 Accepted 100
37 7 0020.0 2128 Accepted 100
38 7 0320.0 8364 Accepted 100
39 7 0320.0 8368 Accepted 100
40 7 0320.0 8352 Accepted 100
41 7 0328.0 8440 Accepted 100
42 7 0020.0 2136 Accepted 100
43 7 0288.0 8380 Accepted 100
Submitter:
Caido
Compiler:
c++14
Code Length:
3.42 KB
Back to Top