QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#303741#6510. Best Carry Player 3HaPpY1213TL 0ms3912kbC++171.4kb2024-01-12 22:32:282024-01-12 22:32:28

Judging History

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

  • [2024-01-12 22:32:28]
  • 评测
  • 测评结果:TL
  • 用时:0ms
  • 内存:3912kb
  • [2024-01-12 22:32: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_clzll(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);
    }
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3912kb

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
Time Limit Exceeded

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:


result: