QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #115646 | #6510. Best Carry Player 3 | jzh# | WA | 77ms | 3416kb | C++14 | 1.6kb | 2023-06-26 14:33:42 | 2023-06-26 14:33:43 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int count(int k) {
int num = 0;
while (k) {
k >>= 1;
num++;
}
return num;
}
int getval(ll x, ll y, ll k) {
ll mid = (x ^ y);
if (mid == 0) return 0;
if (mid <= k) return 1;
return 2;
}
void solve() {
ll x, y, k;
cin >> x >> y >> k;
if (x == y) {
cout << 0 << "\n";
return;
}
if (k <= 1) {
cout << abs(x - y) << "\n";
return;
}
ll nk = count(k);
ll dkz = (1 << (nk)) - 1;
if (x > y) {
ll high_cost = ((x >> nk) - (y >> nk));
if (high_cost == 0) {
ll need = (x & dkz) ^ (y ^ dkz);
ll ans = getval(x & dkz, y & dkz, k);
cout << ans << "\n";
return;
}
ll d1 = getval(x & dkz, 0, k);
ll mid = (high_cost - 1) * (dkz == k ? 1 : 2) + high_cost;
ll d2 = getval(y & dkz, dkz, k);
cout << d1 + mid + d2 << "\n";
return;
} else {
ll high_cost = abs(((x >> nk) - (y >> nk)));
if (high_cost == 0) {
ll ans = getval(x & dkz, y & dkz, k);
cout << ans << "\n";
return;
}
ll d1 = getval(x&dkz, dkz , k);
ll mid = (high_cost - 1) * (dkz == k ? 1 : 2) + high_cost;
ll d2 = getval(y&dkz,0,k);
cout << d1 + mid + d2 << "\n";
return;
}
}
int main() {
ios::sync_with_stdio(false);
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
/*
5
2
1 2
3
2 3 1
4
1 4 3 2
5
1 5 2 3 4
6
1 2 3 4 5 6
*/
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3416kb
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: 77ms
memory: 3352kb
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'