QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #141554 | #6510. Best Carry Player 3 | Nyans | WA | 21ms | 1636kb | C++14 | 605b | 2023-08-17 16:26:39 | 2023-08-17 16:26:41 |
Judging History
answer
#include <cstdio>
#include <algorithm>
int T;
long long x, y, k;
int main() {
scanf("%d", &T);
while (T--){
scanf("%lld%lld%lld", &x, &y, &k);
if (x > y) std :: swap(x, y);
if (k == 0) {
printf("%lld\n", y - x);
continue;
}
long long B = 2ll << std :: __lg(k);
if (x / B == y / B) {
puts((x ^ y) <= k? "1": "2");
continue;
}
long long ans = ((y / B) - (x / B)) * 2 - 1;
if (B != k + 1) ans += (y / B) - (x / B) - 1;
if (x % B != B - 1) ans += ((B - 1) ^ (x % B)) <= k? 1: 2;
if (y % B != 0) ans += y % B <= k? 1: 2;
printf("%lld\n", ans);
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 1636kb
input:
8 4 5 0 5 8 3 9 2 6 15 28 5 97 47 8 164 275 38 114514 1919 810 0 1152921504606846975 1
output:
1 2 3 5 11 6 331 1152921504606846975
result:
ok 8 numbers
Test #2:
score: -100
Wrong Answer
time: 21ms
memory: 1552kb
input:
100000 84 318 6 54 226 7 92 33 0 39 54 5 76 79 7 247 110 0 211 90 0 4 430 3 230 17 1 491 93 5 196 117 7 137 29 2 76 490 6 422 43 7 277 26 4 159 43 1 67 37 5 17 2 5 113 176 7 85 473 0 68 217 7 275 8 7 124 34 1 30 66 0 80 149 3 103 149 6 84 354 1 27 342 7 94 114 1 69 125 1 72 48 7 361 8 7 285 82 1 74 ...
output:
87 45 59 6 1 137 121 213 213 150 21 81 156 95 95 116 12 6 16 388 39 67 90 36 35 17 270 79 20 56 6 89 203 108 26 15 157 98 111 389 174 123 59 289 78 17 21 36 275 191 17 102 60 93 100 11 6 79 44 63 91 60 22 109 11 3 10 67 11 85 207 47 39 83 156 189 107 27 81 247 81 335 33 144 11 50 54 347 233 175 30 7...
result:
wrong answer 809th numbers differ - expected: '1', found: '2'