QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#359427 | #6510. Best Carry Player 3 | Rykony | WA | 34ms | 3848kb | C++14 | 1.4kb | 2024-03-20 17:46:08 | 2024-03-20 17:46:09 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int _=1;
cin>>_;
while (_--){
int x,y,k;
cin>>x>>y>>k;
if (x>y) swap(x,y);
if ((x^y)<=k){
cout<<min(y-x,1ll)<<'\n';
continue;
}
if (k==0){
cout<<y-x<<'\n';
continue;
}
vector <int> a(100,0),b(100,0),c(100,0);
int tem=x,id=0;
while (tem){
a[id++]=tem%2;
tem/=2;
}
for (int i=id;i<100;i++) a[i]=-id;
tem=y,id=0;
while (tem){
b[id++]=tem%2;
tem/=2;
}
for (int i=id;i<100;i++) b[i]=-id;
tem=k,id=0;
while (tem){
c[id++]=tem%2;
tem/=2;
}
for (int i=id;i<100;i++) c[i]=-id;
if (b[99]==c[99]){
cout<<min(2ll,y-x)<<'\n';
continue;
}
vector <int> pl(62);
pl[0]=1;
for (int i=1;i<62;i++) pl[i]=pl[i-1]*2;
int det=0;
for (int i=-c[99];i<-b[99];i++){
det+=pl[i+c[99]]*(b[i]-(a[i]<0?0:a[i]));
}
int bta=0;
for (int i=-c[99];i<-a[99];i++){
bta+=pl[i]*a[i];
}
int ans=0;
if (x==bta) ans+=0;
else if ((x-bta)==pl[-c[99]]-1) ans++;
else if (((pl[-c[99]]-1)^(x-bta))<=k) ans+=2;
else ans+=3;
if (k==(pl[-c[99]]-1)) ans+=2*(det-(x!=bta));
else ans+=3*(det-(x!=bta));
det=0;
for (int i=-c[99];i<-b[99];i++){
det+=b[i]*pl[i];
}
tem=y;
y-=det;
if (!y) ans+=0;
else if (y<=k) ans++;
else ans+=2;
cout<<min(tem-x,ans)<<'\n';
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3848kb
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: 34ms
memory: 3584kb
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: '0'