QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #155534 | #6510. Best Carry Player 3 | PhantomThreshold# | WA | 14ms | 3592kb | C++20 | 783b | 2023-09-01 19:02:46 | 2023-09-01 19:02:46 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int T;
cin>>T;
while(T--)
{
long long k;
auto solve=[&](long long x,long long y)
{
if(x==y)return 0;
if(abs(x-y)==1 or (x^y)<=k)return 1;
return 2;
};
long long x,y;
cin>>x>>y>>k;
if(x>y)swap(x,y);
long long L=1,l=0;
while(L<=k)L<<=1,l++;
long long mask=L-1;
long long ans=0;
if((x>>l)==(y>>l))
{
ans+=solve(x,y);
}
else
{
long long one=3;
if(L==1)one=1;
if(k==mask or L==2)one=2;
// cerr<<"one "<<one<<endl;
ans+=(abs((x>>l)-(y>>l))-1)*one+1;
// cerr<<"first part "<<ans<<endl;
ans+=solve(x,x|mask);
ans+=solve(y,y&~mask);
}
cout<<ans<<"\n";
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3592kb
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: 14ms
memory: 3544kb
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 117 6 1 273 241 213 213 150 21 81 156 95 95 116 12 6 16 775 39 67 90 71 35 17 270 79 20 56 6 89 203 215 26 29 157 98 111 389 174 123 117 289 155 33 21 36 275 381 17 102 60 93 100 11 6 79 44 63 91 60 22 109 21 3 10 67 11 85 207 47 39 83 156 189 107 27 81 247 81 669 33 144 11 50 54 347 233 175 3...
result:
wrong answer 3rd numbers differ - expected: '59', found: '117'