QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #195902 | #6510. Best Carry Player 3 | zkqall | WA | 10ms | 4096kb | C++14 | 1.7kb | 2023-10-01 09:05:02 | 2023-10-01 09:05:03 |
Judging History
answer
//c++ -Wall -std=c++14 -O2 -Wl,--stack=128000000
#include<bits/stdc++.h>
#define ll long long
#define pa pair<ll,ll>
#define ve vector<ll>
#define db double
#define pb push_back
#define py puts("Yes")
#define pn puts("No")
#define re register
#define rd read()
using namespace std;
const db eps=1e-5;
const ll mod=1e9+7,N=1000005,maxn=1ll<<60;
ll n,m,a,b,t,k,ans;
inline ll read(){
ll x=0,f=1;static char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+(c-48);c=getchar();}
return x*f;
}
ll wei(ll x){
ll p=0;
while(x){
x>>=1;
p++;
}
return p;
}
ll fan(ll x,ll k){
ll p=0;
for(int i=0;i<k;i++){
p|=(((x>>i)&1)^1)<<i;
}
return p;
}
ll lastk(ll x,ll k){
return x^((x>>k)<<k);
}
bool mod2(ll x){
while(!(x&1)){
x>>=1;
}
return x==1;
}
signed main(){
t=rd;
while(t--){
ans=0;
a=rd,b=rd,k=rd;
if(a==b){
printf("%lld\n",ans);
continue;
}
if(a>b)swap(a,b);
if(k<=1){
printf("%lld\n",b-a);
continue;
}
if(a<b){
ll p=lastk(k,wei(k)-1),w=wei(k)-1;
if(mod2(lastk(a,w+1)+1))ans++,a++;
ll o=ans;
if(mod2(k+1)){
if((a^b)<=k){
printf("*%lld\n",ans+1);
continue;
}
ans+=((b>>(w+1))-(a>>(w+1)))*2;
if(lastk(b,w+1))ans++;
if(lastk(a,w+1))ans--;
printf("%lld\n",ans);
continue;
}
ans+=((b>>(w+1))-(a>>(w+1)))*3;
if(ans-o==0){
if((b^a)>k)ans+=2;
else ans++;
printf("%lld\n",ans);
continue;
}
if(lastk(b,w+1)>k)ans+=2;
else if(lastk(b,w+1))ans++;
if(fan(lastk(a,w+1),w+1)<=k)ans--;
printf("%lld\n",ans);
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3792kb
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: 10ms
memory: 4096kb
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 44 59 6 *1 137 121 213 213 150 20 82 156 95 95 116 12 6 16 388 38 67 90 36 35 17 270 79 20 56 6 89 203 108 27 15 158 99 110 389 174 123 59 289 78 17 21 35 276 191 17 102 60 93 100 10 6 80 45 63 91 60 23 110 11 3 11 67 11 85 207 47 39 83 156 189 106 27 81 247 81 335 32 145 12 49 54 348 233 175 30 ...
result:
wrong answer 2nd numbers differ - expected: '45', found: '44'