QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#590315 | #6510. Best Carry Player 3 | CMing | WA | 19ms | 3516kb | C++17 | 1.2kb | 2024-09-25 23:12:12 | 2024-09-25 23:12:12 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> PII;
int solve()
{
int x, y, k; cin >> x >> y >> k;
if(x == y) return 0;
int mx = 0;
int n = 59;
for(int i = n; i >= 0; i--)
if(k >> i & 1)
{
mx = (1LL << i + 1) - 1;
break;
}
if(x > y) swap(x, y);
int add = 0;
int t = 0;
for(int i = n; i >= 0; i--)
{
if((y >> i & 1) == (x >> i & 1)) continue;
if((x | mx) >= y)
{
if((x ^ y) <= k) t++;
else t += 2;
break;
}
else
{
int tmp = x ^ (x | mx);
if(tmp <= k && tmp > 0) t++;
if(tmp > k) t += 2;
x |= mx;
x++;
add++;
int time = (y - x) / (mx + 1);
add += time;
t += time;
if(mx > k) t += time;
x += time * (mx + 1);
}
}
return add + t;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
cin >> t;
while(t--)
{
cout << solve() << "\n";
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3500kb
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: 3516kb
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 117 6 1 273 241 213 213 150 21 81 156 95 95 116 12 6 16 775 39 67 90 71 35 17 270 79 20 56 6 89 203 215 26 29 157 98 111 389 174 123 117 289 155 33 21 36 275 381 17 102 60 93 100 11 6 79 44 63 91 60 22 109 21 3 10 67 11 85 207 47 39 83 156 189 107 27 81 247 81 669 33 144 11 50 54 347 233 175 3...
result:
wrong answer 3rd numbers differ - expected: '59', found: '117'