QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#665282 | #6510. Best Carry Player 3 | hhoppitree | WA | 19ms | 3876kb | C++17 | 935b | 2024-10-22 10:49:55 | 2024-10-22 10:49:55 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
signed main() {
int T; scanf("%d", &T);
while (T--) {
long long x, y, z; scanf("%lld%lld%lld", &x, &y, &z);
if (x == y) {
puts("0");
continue;
}
if (z <= 1) {
printf("%lld\n", abs(x - y));
continue;
}
if (x > y) swap(x, y);
int k = 0;
while ((1ll << k) <= z) ++k;
if ((x >> k) == (y >> k)) {
if (x + 1 == y || (x ^ y) <= z) puts("1");
else puts("2");
} else {
long long e1 = (((x >> k) + 1) << k) - 1, e2 = ((y >> k) << k);
long long res = (x == e1 ? 0 : (x + 1 == e1 || (x ^ e1) <= z ? 1 : 2)) + (y == e2 ? 0 : (y - 1 == e2 || (y ^ e2) <= z ? 1 : 2)) + 1;
printf("%lld\n", res + ((e2 - 1 - e1) >> k) * (2 + (z != (1 << y) - 1)));
}
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3804kb
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: 19ms
memory: 3876kb
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 66 59 6 1 137 121 318 213 150 30 81 156 141 95 116 12 6 23 388 57 99 90 36 51 17 270 117 20 56 8 132 203 108 26 15 157 98 165 389 174 123 59 289 78 17 21 53 275 191 17 102 60 93 100 15 6 79 44 63 91 60 22 109 11 3 10 99 11 85 207 47 39 83 156 189 159 27 120 247 120 335 48 144 11 74 54 347 233 261...
result:
wrong answer 2nd numbers differ - expected: '45', found: '66'