QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #114530 | #6510. Best Carry Player 3 | Lavine# | WA | 19ms | 3844kb | C++20 | 936b | 2023-06-22 14:25:07 | 2023-06-22 14:25:09 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int T;
long long x,y,z;
void slv(){
scanf("%lld %lld %lld",&x,&y,&z);
if(x>y)swap(x,y);
if(z<=1){
printf("%lld\n",y-x);
return;
}
long long k=1;
while(k<=z)k<<=1;
long long t=y/k-x/k;
// printf("__%lld\n",t);
if(t==0){
long long w=y^x;
if(w==0)puts("1");
else if(w<=z)puts("1");
else puts("2");
return;
}else {
long long rs=0;
x&=k-1,y&=k-1;
if(x==k-1)rs=1;
else if(((k-1)^x)<=z)rs=2;
else rs=3;
if(z==k-1)rs+=2*(t-1);
else rs+=3*(t-1);
if(y==0)rs+=0;
else if(y<=z)rs+=1;
else rs+=2;
printf("%lld\n",rs);
return;
}
}
int main(){
#ifdef _DEBUG
freopen("data.txt", "r", stdin);
#endif
scanf("%d",&T);
while(T--)slv();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3564kb
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: 19ms
memory: 3844kb
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 809th numbers differ - expected: '1', found: '2'