Old results of submission #273452

Back to Submissions List View New Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2203. 動態資料結構（Kinetic Data Structure）
3700
7568
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 6616 Accepted 100
1 1 3 7 0004.0 6564 Accepted 100
2 2 4 6 7 0004.0 6576 Accepted 100
3 2 4 6 7 0004.0 6712 Accepted 100
4 2 4 6 7 0016.0 7472 Accepted 100
5 2 4 6 7 0016.0 7544 Accepted 100
6 2 4 6 7 0016.0 7472 Accepted 100
7 2 4 6 7 0016.0 7472 Accepted 100
8 2 4 6 7 0040.0 7348 Accepted 100
9 3 7 0004.0 6568 Accepted 100
10 3 7 0004.0 6640 Accepted 100
11 3 7 0004.0 6620 Accepted 100
12 3 7 0008.0 6696 Accepted 100
13 3 7 0004.0 6764 Accepted 100
14 3 7 0008.0 6700 Accepted 100
15 3 7 0008.0 7404 Accepted 100
16 4 7 0004.0 6564 Accepted 100
17 4 7 0004.0 6644 Accepted 100
18 4 7 0136.0 7476 Accepted 100
19 4 7 0140.0 7456 Accepted 100
20 4 7 0148.0 7476 Accepted 100
21 4 7 0144.0 7488 Accepted 100
22 4 7 0084.0 7500 Accepted 100
23 5 6 7 0004.0 6584 Accepted 100
24 5 6 7 0004.0 6692 Accepted 100
25 5 6 7 0208.0 7456 Accepted 100
26 5 6 7 0220.0 7468 Accepted 100
27 5 6 7 0216.0 7568 Accepted 100
28 5 6 7 0212.0 7548 Accepted 100
29 5 6 7 0008.0 7260 Accepted 100
30 6 7 0004.0 6560 Accepted 100
31 6 7 0004.0 6668 Accepted 100
32 6 7 0200.0 7476 Accepted 100
33 6 7 0196.0 7516 Accepted 100
34 6 7 0196.0 7480 Accepted 100
35 6 7 0200.0 7464 Accepted 100
36 6 7 0132.0 7376 Accepted 100
37 7 0020.0 6788 Accepted 100
38 7 0220.0 7564 Accepted 100
39 7 0228.0 7548 Accepted 100
40 7 0220.0 7516 Accepted 100
41 7 0224.0 7472 Accepted 100
42 7 0016.0 6848 Accepted 100
43 7 0148.0 7464 Accepted 100
Submitter:
FHVirus
Compiler:
c++14
Code Length:
3.4 KB
Back to Top