QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #184222 | #6510. Best Carry Player 3 | SolarExpress# | WA | 59ms | 3420kb | C++14 | 575b | 2023-09-20 15:26:52 | 2023-09-20 15:26:52 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int T;
long long x,y,k;
int main(){
cin>>T;
while(T--){
cin>>x>>y>>k;
if(x<y)swap(x,y);
if(!k){
cout<<(x-y)<<endl;
continue;
}
long long bt=1,wei=0,xx=x,yy=y,ad,ans=0;
while(bt<=k)bt<<=1,wei++;
bt--;
if((x^y)>bt){
xx>>=wei,yy>>=wei;
ad=(bt==k)? 1:2;
ans+=(xx-yy)*(ad+1);
if(ad==2)if(((y&bt)^bt)<=k)ans--;
if((y&bt)==bt)ans--;
if(x&bt){
if((x&bt)>k)ans++;
ans++;
}
}
else if(x!=y){
ans=1;
if((x^y)>k)ans++;
}
cout<<ans<<endl;
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3408kb
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: 59ms
memory: 3420kb
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'