QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#303734 | #6510. Best Carry Player 3 | HaPpY1213 | WA | 1ms | 3692kb | C++17 | 1.3kb | 2024-01-12 22:24:37 | 2024-01-12 22:24:38 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int t;scanf("%d",&t);
while(t--){
ll x,y,k;scanf("%lld%lld%lld",&x,&y,&k);
ll l=63-__builtin_clzll(k),r=3;
if((1ll<<l+1)==k+1)r=2;
if(!l||!(x^y)){
printf("%lld\n",x^y);
continue;
}
if((x^y)<=k){
puts("1");
continue;
}l++;
ll ans=0,mid=0;
if(x<y){
for(int i=0;i<l;i++){
if(!(x>>i&1))
mid+=1ll<<i,x+=1ll<<i;
}
if(mid)ans++;
if(mid>k)ans++;
if(x>=y){
puts("2");
continue;
}
ans++;x++;
y-=x;
ans+=y/(1ll<<l)*r;y%=(1ll<<l);
if(y)ans++;
if(y>k)ans++;
}
else {
for(int i=0;i<l;i++){
if(x>>i&1)
mid+=1ll<<i,x-=1ll<<i;
}
if(mid)ans++;
if(mid>k)ans++;
if(x<=y){
puts("2");
continue;
}
ans++;x--;
y=x-y;
ans+=y/(1ll<<l)*r;y%=(1ll<<l);
if(y)ans++;
if(y>k)ans++;
}
printf("%lld\n",ans);
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3692kb
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:
2 2 3 5 11 6 331 1152921504606846975
result:
wrong answer 1st numbers differ - expected: '1', found: '2'