QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #865060 | #9675. 电池检测 | args | 5 | 1ms | 3840kb | C++14 | 655b | 2025-01-21 14:26:04 | 2025-01-21 14:26:05 |
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a,b;
void input(){
scanf("%lld %lld",&a,&b);
}
void solve(){
ll n=a+b;
if(n%2==0){
if(a>b) printf("%lld\n",b+1);
else if(a==b) printf("%lld\n",a+4);
else{
ll c=n/2,t=(b-a)/2;
//c组，t组(b,b)
printf("%lld\n",c+(t+1)*2*(t+1));
}
}else{
if(a>b+1) printf("%lld\n",b+1);
else if(a==b+1) printf("%lld\n",b+2);
else if(a==b-1) printf("%lld\n",a+4);
else{
ll c=n/2,t=(b-a)/2;
printf("%lld\n",c+(t+1)*2*(t+1));
}
}
}
int main(){
ll T;
scanf("%lld",&T);
for(ll i=1;i<=T;i++){
input();
solve();
}
return 0;
}
详细
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 10
Accepted
time: 1ms
memory: 3840kb
input:
3 2 1 3 1 2 2
output:
3 2 6
result:
ok 3 number(s): "3 2 6"
Test #2:
score: 0
Wrong Answer
time: 0ms
memory: 3840kb
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 6 11 2 4 7 7 2 3 5 8
result:
wrong answer 3rd numbers differ - expected: '10', found: '6'
Subtask #2:
score: 0
Wrong Answer
Test #3:
score: 0
Wrong Answer
time: 0ms
memory: 3840kb
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 6 11 11 22 22 37 37 56 56 79 79 106 106 137 137 172 172 211 211 254 254 301 301 352 352 407 407 466 466 529 529 596 596 667 667 742 742 821 821 904 904 991 991 1082 1082 1177 1177 1276 1276 1379 1379 1486 1486 1597 1597 1712 1712 1831 1831 1954 1954 2081 2081 2212 2212 2347 2347 2486 2486 2629 2...
result:
wrong answer 3rd numbers differ - expected: '10', found: '6'
Subtask #3:
score: 0
Wrong Answer
Test #4:
score: 0
Wrong Answer
time: 0ms
memory: 3840kb
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 7 7 12 12 23 23 38 38 57 57 80 80 107 107 138 138 173 173 212 212 255 255 302 302 353 353 408 408 467 467 530 530 597 597 668 668 743 743 822 822 905 905 992 992 1083 1083 1178 1178 1277 1277 1380 1380 1487 1487 1598 1598 1713 1713 1832 1832 1955 1955 2082 2082 2213 2213 2348 2348 2487 2487 2630...
result:
wrong answer 3rd numbers differ - expected: '6', found: '7'
Subtask #4:
score: 5
Accepted
Test #5:
score: 5
Accepted
time: 1ms
memory: 3840kb
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:
242 436 140 2 36 408 323 962 311 37 501 188 372 15 181 29 254 813 6 63 341 225 36 57 86 411 249 471 7 772 303 28 41 518 148 295 107 28 197 374 35 337 236 92 714 832 465 377 70 496 141 52 38 47 632 355 96 329 130 395 233 124 815 408 201 20 56 630 544 62 379 618 415 17 131 265 179 232 316 109 60 266 7...
result:
ok 1000 numbers
Subtask #5:
score: 0
Skipped
Dependency #1:
0%
Subtask #6:
score: 0
Skipped
Dependency #5:
0%
Subtask #7:
score: 0
Skipped
Dependency #1:
0%