QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#858875#9675. 电池检测HuTao60 269ms19612kbC++14541b2025-01-17 08:17:282025-01-17 08:17:29

Judging History

你现在查看的是最新测评结果

  • [2025-01-17 08:17:29]
  • 评测
  • 测评结果：60
  • 用时：269ms
  • 内存：19612kb
查看
  • [2025-01-17 08:17:28]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

const int N = 2005;

int n, m;
int f[N][N];

int main()
{
    n = 2000, m = 1000;
    memset(f, 0x3f, sizeof f);
    f[0][0] = 0;
    for(int i = 1; i <= n; i ++ )
        for(int j = i; j <= m; j ++ )
            for(int k = 1; k <= j; k ++ )
                f[i][j] = min(f[i][j], f[i - 1][j - k] + k * (k - 1) / 2);
    int T;
    scanf("%d", &T);
    while(T -- )
    {
        scanf("%d%d", &n, &m);
        printf("%d\n", f[n - 1][n + m]);
    }
    return 0;
}
源文件, 语言: C++14

详细

Subtask #1:

score: 10
Accepted

Test #1:

score: 10
Accepted
time: 266ms
memory: 19572kb

input:

3
2 1
3 1
2 2

output:

3
2
6

result:

ok 3 number(s): "3 2 6"

Test #2:

score: 10
Accepted
time: 267ms
memory: 19576kb

input:

12
2 1
2 2
2 3
2 4
3 1
3 2
3 3
3 4
4 1
4 2
4 3
4 4

output:

3
6
10
15
2
4
6
9
2
3
5
7

result:

ok 12 numbers

Subtask #2:

score: 0
Wrong Answer

Test #3:

score: 0
Wrong Answer
time: 266ms
memory: 19528kb

input:

1000
2 1
2 2
2 3
2 4
2 5
2 6
2 7
2 8
2 9
2 10
2 11
2 12
2 13
2 14
2 15
2 16
2 17
2 18
2 19
2 20
2 21
2 22
2 23
2 24
2 25
2 26
2 27
2 28
2 29
2 30
2 31
2 32
2 33
2 34
2 35
2 36
2 37
2 38
2 39
2 40
2 41
2 42
2 43
2 44
2 45
2 46
2 47
2 48
2 49
2 50
2 51
2 52
2 53
2 54
2 55
2 56
2 57
2 58
2 59
2 60
2 61...

output:

3
6
10
15
21
28
36
45
55
66
78
91
105
120
136
153
171
190
210
231
253
276
300
325
351
378
406
435
465
496
528
561
595
630
666
703
741
780
820
861
903
946
990
1035
1081
1128
1176
1225
1275
1326
1378
1431
1485
1540
1596
1653
1711
1770
1830
1891
1953
2016
2080
2145
2211
2278
2346
2415
2485
2556
2628
27...

result:

wrong answer 999th numbers differ - expected: '500500', found: '1061109567'

Subtask #3:

score: 0
Wrong Answer

Test #4:

score: 0
Wrong Answer
time: 267ms
memory: 19612kb

input:

1000
3 1
3 2
3 3
3 4
3 5
3 6
3 7
3 8
3 9
3 10
3 11
3 12
3 13
3 14
3 15
3 16
3 17
3 18
3 19
3 20
3 21
3 22
3 23
3 24
3 25
3 26
3 27
3 28
3 29
3 30
3 31
3 32
3 33
3 34
3 35
3 36
3 37
3 38
3 39
3 40
3 41
3 42
3 43
3 44
3 45
3 46
3 47
3 48
3 49
3 50
3 51
3 52
3 53
3 54
3 55
3 56
3 57
3 58
3 59
3 60
3 61...

output:

2
4
6
9
12
16
20
25
30
36
42
49
56
64
72
81
90
100
110
121
132
144
156
169
182
196
210
225
240
256
272
289
306
324
342
361
380
400
420
441
462
484
506
529
552
576
600
625
650
676
702
729
756
784
812
841
870
900
930
961
992
1024
1056
1089
1122
1156
1190
1225
1260
1296
1332
1369
1406
1444
1482
1521
15...

result:

wrong answer 998th numbers differ - expected: '250000', found: '1061109567'

Subtask #4:

score: 0
Wrong Answer

Test #5:

score: 0
Wrong Answer
time: 269ms
memory: 19444kb

input:

1000
907 241
495 435
227 139
616 1
433 35
588 407
533 322
995 961
748 310
212 36
968 500
294 187
375 371
307 14
648 180
122 28
304 253
818 812
41 5
286 62
573 340
547 224
347 35
279 56
151 85
626 410
456 248
578 470
11 6
952 771
404 302
77 27
168 40
524 517
171 147
407 294
268 106
100 27
549 196
973...

output:

1061109567
436
140
2
36
408
323
1061109567
1061109567
37
1061109567
188
372
15
181
29
254
1061109567
6
63
341
225
36
57
86
1061109567
249
1061109567
7
1061109567
303
28
41
1061109567
148
295
107
28
197
1061109567
35
337
236
92
1061109567
1061109567
1061109567
1061109567
70
1061109567
141
52
38
47
10...

result:

wrong answer 1st numbers differ - expected: '242', found: '1061109567'

Subtask #5:

score: 20
Accepted

Dependency #1:

100%
Accepted

Test #6:

score: 20
Accepted
time: 265ms
memory: 19608kb

input:

90
2 1
2 2
2 3
2 4
2 5
2 6
2 7
2 8
2 9
2 10
3 1
3 2
3 3
3 4
3 5
3 6
3 7
3 8
3 9
3 10
4 1
4 2
4 3
4 4
4 5
4 6
4 7
4 8
4 9
4 10
5 1
5 2
5 3
5 4
5 5
5 6
5 7
5 8
5 9
5 10
6 1
6 2
6 3
6 4
6 5
6 6
6 7
6 8
6 9
6 10
7 1
7 2
7 3
7 4
7 5
7 6
7 7
7 8
7 9
7 10
8 1
8 2
8 3
8 4
8 5
8 6
8 7
8 8
8 9
8 10
9 1
9 2
9 ...

output:

3
6
10
15
21
28
36
45
55
66
2
4
6
9
12
16
20
25
30
36
2
3
5
7
9
12
15
18
22
26
2
3
4
6
8
10
12
15
18
21
2
3
4
5
7
9
11
13
15
18
2
3
4
5
6
8
10
12
14
16
2
3
4
5
6
7
9
11
13
15
2
3
4
5
6
7
8
10
12
14
2
3
4
5
6
7
8
9
11
13

result:

ok 90 numbers

Subtask #6:

score: 30
Accepted

Dependency #5:

100%
Accepted

Test #7:

score: 30
Accepted
time: 267ms
memory: 19504kb

input:

870
2 1
2 2
2 3
2 4
2 5
2 6
2 7
2 8
2 9
2 10
2 11
2 12
2 13
2 14
2 15
2 16
2 17
2 18
2 19
2 20
2 21
2 22
2 23
2 24
2 25
2 26
2 27
2 28
2 29
2 30
3 1
3 2
3 3
3 4
3 5
3 6
3 7
3 8
3 9
3 10
3 11
3 12
3 13
3 14
3 15
3 16
3 17
3 18
3 19
3 20
3 21
3 22
3 23
3 24
3 25
3 26
3 27
3 28
3 29
3 30
4 1
4 2
4 3
4 ...

output:

3
6
10
15
21
28
36
45
55
66
78
91
105
120
136
153
171
190
210
231
253
276
300
325
351
378
406
435
465
496
2
4
6
9
12
16
20
25
30
36
42
49
56
64
72
81
90
100
110
121
132
144
156
169
182
196
210
225
240
256
2
3
5
7
9
12
15
18
22
26
30
35
40
45
51
57
63
70
77
84
92
100
108
117
126
135
145
155
165
176
2...

result:

ok 870 numbers

Subtask #7:

score: 0
Skipped

Dependency #1:

100%
Accepted

Dependency #2:

0%
English 繁體中文 简体中文

服务器时间: 2025-02-01 22:58:10 | 开源项目