QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #859063 | #9675. 电池检测 | 08kevin | 5 | 1ms | 3840kb | C++14 | 667b | 2025-01-17 14:27:52 | 2025-01-17 14:27:52 |
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll T, a, b;
int main() {
scanf("%lld", &T);
while (T--) {
scanf("%lld%lld", &a, &b);
if (a > b + 1) {
printf("%lld\n", b + 1);
} else {
if (a == b + 1) {
printf("%lld\n", min((a + b) * (a + b) - a * a + 1, b + 2));
} else {
if (a == b) {
printf("%lld\n", b + 4);
} else {
if ((a + b) & 1) {
ll x = (a + b) / 2;
printf("%lld\n", x + (x - (a - 1) + 1) * 2 + (x * x - a * a + 1) * 4);
} else {
ll x = (a + b) / 2;
printf("%lld\n", x + (x * x - a * a + 1) * 4);
}
}
}
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 10
Accepted
time: 0ms
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 10 27 2 4 7 11 2 3 5 8
result:
wrong answer 4th numbers differ - expected: '15', found: '27'
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 10 27 33 56 64 93 103 138 150 191 205 252 268 321 339 398 418 483 505 576 600 677 703 786 814 903 933 1028 1060 1161 1195 1302 1338 1451 1489 1608 1648 1773 1815 1946 1990 2127 2173 2316 2364 2513 2563 2718 2770 2931 2985 3152 3208 3381 3439 3618 3678 3863 3925 4116 4180 4377 4443 4646 4714 4923...
result:
wrong answer 4th numbers differ - expected: '15', found: '27'
Subtask #3:
score: 0
Wrong Answer
Test #4:
score: 0
Wrong Answer
time: 1ms
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 11 36 42 73 81 118 128 171 183 232 246 301 317 378 396 463 483 556 578 657 681 766 792 883 911 1008 1038 1141 1173 1282 1316 1431 1467 1588 1626 1753 1793 1926 1968 2107 2151 2296 2342 2493 2541 2698 2748 2911 2963 3132 3186 3361 3417 3598 3656 3843 3903 4096 4158 4357 4421 4626 4692 4903 4971...
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%