QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#235283 | #6510. Best Carry Player 3 | stcmuyi# | WA | 21ms | 3404kb | C++20 | 1.6kb | 2023-11-02 16:55:20 | 2023-11-02 16:55:21 |
Judging History
answer
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define i64 long long
#define int long long
#define endl '\n'
#define lb(x) ((x) & (-x))
using namespace std;
const i64 mod = 1e9+7;
const int maxn = 1e4+10;
int ck(int x)
{
int len = 0;
while(x)
{
len++;
x >>= 1;
}
return len;
}
signed main()
{
IOS;
int t;
cin >> t;
while(t--)
{
i64 x,y,k;
cin >> x >> y >> k;
int ans = 0,len = ck(k);
int res = (k == (1LL << len) - 1 ? 1 : 2);
int now = 0;
for(int i = len-1; i >= 0; --i)
{
if(x < y && (x >> i & 1) == 0 && x + (1LL << i) <= y)
{
x += (1LL << i);
now += (1LL << i);
}
if(x > y && (x >> i & 1) == 1 && x - (1LL << i) >= y)
{
x -= (1LL << i);
now += (1LL << i);
}
}
if(now) ans += (now > k ? 2 : 1);
for(int i = 59; i >= len; --i)
{
if((x >> i & 1) != (y >> i & 1))
{
ans++;
if(x < y) x++;
else x--;
int xx = (x >> len),yy = (y >> len);
if(x < y) ans += (yy-xx) * (res+1);
else ans += (xx - yy) * (res + 1);
break;
}
}
now = 0;
for(int i = 0; i < len; ++i) if((x >> i & 1) != (y >> i & 1)) now += (1LL << i);
if(now) ans += (now > k ? 2 : 1);
cout << ans << endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3356kb
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: 21ms
memory: 3404kb
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'