QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #303824 | #6510. Best Carry Player 3 | mc020207 | WA | 16ms | 3660kb | C++17 | 1.1kb | 2024-01-13 00:39:00 | 2024-01-13 00:39:01 |
Judging History
answer
#include<bits/stdc++.h>
#define MAXN 500010
#define INF 1000000010
#define MOD 998244353
#define LL long long
#define LLL __int128_t
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
void Main(){
LL x,y,k;cin>>x>>y>>k;
LL mn=abs(y-x);
if (x>y) swap(x,y);
if (k<=1){
cout<<y-x<<"\n";
return ;
}
if (x==y){
cout<<0<<"\n";
return ;
}
if ((x^y)<=k){
cout<<1<<"\n";
return ;
}
int len=0;
For(i,1,61){
len=i;
if ((1LL<<len)>k) break;
}
LL base=(1LL<<len);
if (x/base==y/base){
cout<<2<<"\n";
return ;
}
int step=1;
if (k==(base-1)) step=2;
else step=3;
LL ans=0;
if (x%base==base-1) ans=1;
else if (((base-1)^(x%base))<=k) ans=2;
else ans=3;
x=(x/base+1)*base;
ans+=1LL*(y/base-x/base)*step;
x=(y/base)*base;
if (x==y);
else if ((x^y)<=k) ans++;
else ans+=2;
cout<<min(ans,mn)<<"\n";
}
int main(){
std::ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int T=1;cin>>T;
while (T--) Main();
}
/*
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
*/
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3620kb
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: 16ms
memory: 3660kb
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'