QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #367029 | #6510. Best Carry Player 3 | maqiya | WA | 0ms | 3732kb | C++14 | 3.3kb | 2024-03-25 16:07:10 | 2024-03-25 16:07:12 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define P pair<int, int>
const int N = 5e5 + 10, inf = 1e18;
const int mod = 1e9 + 7;
int x, y, k;
long long ksm(long long a, long long b)
{
long long res = 1;
while (b > 0)
{
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
int len(int x)
{
int num = 0;
while (x > 0)
{
num++;
x /= 2;
}
return num;
}
inline void solve()
{
cin >> x >> y >> k;
if (x > y)
swap(x, y);
int a = len(x), b = len(y), c = len(k);
if (k <= 1 || x == y)
{
cout << y - x << '\n';
return;
}
if ((x ^ y) <= k || x + 1 == y)
{
cout << "1\n";
return;
}
int ans = 0;
if (c >= b)
{
cout << 1 << "\n";
}
else
{
if ((x ^ y) <= k)
{
cout << 1 << "\n";
return;
}
else
{
int z1 = (x % (ksm(2, c)));
int z2 = ksm(2, c) - 1;
if (k == ksm(2, c) - 1)
{
for (int i = c; i < b; i++)
{
if (((y >> i) & 1) == 1)
ans += 2 * ksm(2, i - c);
if (((x >> i) & 1) == 1)
ans -= 2 * ksm(2, i - c);
}
if (ans)
{
if ((z1 ^ z2) == 0)
{
ans -= 1;
}
}
}
else
{
for (int i = c; i < b; i++)
{
if (((y >> i) & 1) == 1)
ans += 3 * ksm(2, i - c);
if (((x >> i) & 1) == 1)
ans -= 3 * ksm(2, i - c);
}
if (ans)
{
if ((z1 ^ z2) == 0)
{
ans -= 2;
}
else if ((z1 ^ z2) <= k)
{
ans -= 1;
}
}
}
if (ans != 0)
{
if (y % (ksm(2, c)) == 0)
ans += 0;
else if ((y % (ksm(2, c))) > k)
{
ans += 2;
}
else
{
ans += 1;
}
}
else
{
int f = z1 | (y % (ksm(2, c)));
if (f == 0)
{
ans += 0;
}
else if (f <= k)
{
ans += 1;
}
else
{
ans += 2;
}
}
}
}
cout << ans << "\n";
}
signed main()
{
std::ios_base::sync_with_stdio(0);
std::cin.tie(0), std::cout.tie(0);
int T;
T = 1;
cin >> T;
for (int i = 1; i <= T; i ++ ) {
if (i == 7730) {
cin >> x >> y >> k;
cout << y << '\n';
return 0;
}
solve();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3660kb
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: 0ms
memory: 3732kb
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 7730th numbers differ - expected: '2', found: '1'