QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #368100 | #6510. Best Carry Player 3 | HuLiangyu# | WA | 95ms | 3664kb | C++14 | 1.2kb | 2024-03-26 20:25:00 | 2024-03-26 20:25:00 |
Judging History
answer
#include <iostream>
using namespace std;
using ll = long long;
void sol() {
ll X, Y, K;
cin >> X >> Y >> K;
if (X > Y) {
swap(X, Y);
}
int len = 0;
while ((1ll << len) <= K) ++len;
if (K == 0) {
cout << Y - X << '\n';
return;
}
if (X == Y) {
cout << 0 << '\n';
return;
}
long long ans=0;
if ((X >> len) == (Y >> len)) {
if ((X ^ Y) <= K) {
cout << 1 << '\n';
} else {
cout << 2 << '\n';
}
} else {
ll g = (Y >> len) - (X >> len);
ll st = (1ll << len) - 1;
ll a = X & st;
if(a==st){
ans++;
}
else if ((a ^ st) <= K) {
//cout<<"2222"<<
ans+=2;
}
else{
ans+=3;
}
if(st<=K)
{
ans+=2*(g-1);
}
else{
ans+=3*(g-1);
}
if((Y &st)==0){
}
else if((Y &st)<=K){
ans++;
}
else ans+=2;
cout<<ans<<"\n";
}
}
int main() {
int T;
cin >> T;
while (T --) {
sol();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3656kb
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: 95ms
memory: 3664kb
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'