QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#108012 | #6510. Best Carry Player 3 | woyouxiangbaile# | WA | 14ms | 3584kb | C++14 | 1.3kb | 2023-05-23 14:02:59 | 2023-05-23 14:03:02 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl
int read() {
int x = 0, f = 1; char c = getchar();
for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
return x * f;
}
int s, t, k;
int solve() {
s = read(), t = read(), k = read();
if (s > t) swap(s, t);
if (!k) return t - s;
int d = __lg(k), all = (1ll << d + 1) - 1;
if ((s >> d + 1) == (t >> d + 1)) {
int x = s ^ t;
return x <= k ? 1 : 2;
}
int ans = 0, cnt = (t >> d + 1) - (s >> d + 1);
if ((s & all) == all) ans = 1;
else if ((s & all) + k >= all) ans = 2;
else ans = 3;
if (0 + k >= all) ans += 2 * (cnt - 1);
else ans += 3 * (cnt - 1);
if ((t & all) == 0) ;
else if ((t & all) <= k) ans += 1;
else ans += 2;
return ans;
}
signed main() {
for (int tc = read(); tc; -- tc) {
printf("%lld\n", solve());
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 3584kb
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: 14ms
memory: 3484kb
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'