QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #858877 | #9675. 电池检测 | HuTao | 0 | 135ms | 19588kb | C++14 | 541b | 2025-01-17 08:18:44 | 2025-01-17 08:18:55 |
Judging History
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 <= i; 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;
}
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 133ms
memory: 19508kb
input:
3 2 1 3 1 2 2
output:
1061109567 1061109567 1061109567
result:
wrong answer 1st numbers differ - expected: '3', found: '1061109567'
Subtask #2:
score: 0
Wrong Answer
Test #3:
score: 0
Wrong Answer
time: 133ms
memory: 19564kb
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:
1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 106...
result:
wrong answer 1st numbers differ - expected: '3', found: '1061109567'
Subtask #3:
score: 0
Wrong Answer
Test #4:
score: 0
Wrong Answer
time: 135ms
memory: 19440kb
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:
1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 1061109567 106...
result:
wrong answer 1st numbers differ - expected: '2', found: '1061109567'
Subtask #4:
score: 0
Wrong Answer
Test #5:
score: 0
Wrong Answer
time: 132ms
memory: 19588kb
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: 0
Skipped
Dependency #1:
0%
Subtask #6:
score: 0
Skipped
Dependency #5:
0%
Subtask #7:
score: 0
Skipped
Dependency #1:
0%