QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#303740#6510. Best Carry Player 3HaPpY1213WA 0ms3616kbC++171.4kb2024-01-12 22:29:282024-01-12 22:29:28

Judging History

你现在查看的是最新测评结果

  • [2024-01-12 22:29:28]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3616kb
  • [2024-01-12 22:29:28]
  • 提交

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_clz(k),r=3;
        if((1ll<<l+1)==k+1)r=2;
        if(!l||!(x^y)){
            printf("%lld\n",abs(x-y));
            continue;
        }
        if((x^y)<=k||abs(x-y)==1){
            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: 0ms
memory: 3616kb

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
2
2
2
2
2
402653183

result:

wrong answer 3rd numbers differ - expected: '3', found: '2'