QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #195882 | #6510. Best Carry Player 3 | shiyihangxs | WA | 11ms | 3768kb | C++14 | 2.2kb | 2023-10-01 08:52:12 | 2023-10-01 08:52:13 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define l(x) (x<<1)
#define r(x) (x<<1|1)
#define mpr make_pair
#define pb push_back
//mt19937_64 ra(time(0) ^ (*new char));
//ios::sync_with_stdio(false);
//cin.tie(0); cout.tie(0);
const ll SIZE = 200005;
const ll mod = 998244353;
ll T;
ll X, Y, K;
ll cnt;
inline ll rd(){
ll x = 0, f = 1;
char ch = getchar();
while(ch < '0' || ch > '9'){
if(ch == '-') f = -1;
ch = getchar();
}
while(ch >= '0' && ch <= '9'){
x = (x<<1) + (x<<3) + (ch^48);
ch = getchar();
}
return x*f;
}
ll power(ll x, ll y){
ll jl = 1;
while(y){
if(y & 1) jl = (jl * x) % mod;
x = (x * x) % mod;
y >>= 1;
}
return jl;
}
ll len(ll x){
ll jl = 0;
while(x){
jl++;
x >>= 1;
}
return jl;
}
int main(){
T = rd();
while(T--){
cnt++;
X = rd(), Y = rd(), K = rd(); ll ans = 0;
if(cnt == 1469) cout << X << Y << K << endl;
if(K == 0){
printf("%lld\n", abs(X-Y));
continue;
}
if(X > Y) swap(X, Y);
ll lk = len(K), lx = len(X), ly = len(Y);
if(X < Y){
if(len(K) > len(Y)) printf("1\n");
else{
ll px = (X&(((1ll<<60)-1)-((1ll<<lk)-1)));
ll py = (Y&(((1ll<<60)-1)-((1ll<<lk)-1)));
if(px == py){
ll jlx = (X&((1ll<<lk)-1));
ll jly = (Y&((1ll<<lk)-1));
if((jlx ^ jly) <= K) ans += min(1ll, abs(X-Y));
else ans += min(2ll, abs(X-Y));
}
ll cc = (py>>lk)-(px>>lk);
if(cc >= 1){
if((X>>(lk-1))&1){
if((X&((1ll<<lk)-1)) == ((1ll<<lk)-1)) ans += 1;
else ans += 2;
}
else{
ll jlx = (X&((1ll<<lk)-1));
if((jlx ^ ((1ll<<lk)-1)) <= K || (jlx&((1ll<<(lk-1))-1)) == ((1ll<<(lk-1))-1)) ans += 2;
else ans += 3;
}
// cout << cc << " " << ans << endl;
if(K == (1ll<<lk)-1) ans += (cc-1) * 2;
else ans += (cc-1) * 3;
ll jly = (Y&((1ll<<lk)-1));
if((jly ^ ((1ll<<lk)-1)) == ((1ll<<lk)-1)) ans += 0;
else if((!((Y>>(lk-1))&1)) || jly <= K) ans += min(1ll, jly);
else ans += min(2ll, jly);
}
printf("%lld\n", ans);
}
}
}
return 0;
}
/*
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
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3476kb
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: 11ms
memory: 3768kb
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 1469th numbers differ - expected: '0', found: '23235'