QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #107404 | #6510. Best Carry Player 3 | black_ice | WA | 29ms | 3532kb | C++14 | 2.1kb | 2023-05-21 10:56:16 | 2023-05-21 10:56:19 |
Judging History
answer
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <array>
#include <queue>
#include <cmath>
using namespace std;
#define int long long
#define endl '\n'
typedef pair<int,int> PII;
const int N = 65,mod = 998244353,INF = 1e18;
int n,T,m,k;
void solve()
{
cin >> n >> m >> k;
if(n == m)
{
cout << 0 << endl;
return ;
}
if(abs(n - m) == 1)
{
cout << 1 << endl;
return ;
}
if(k == 0)
{
cout << abs(n - m) << endl;
return ;
}
int cntk = 0,tmpk = k;
while(k)
{
k >>= 1;
cntk++;
}
if(n < (1 << (cntk)) && m < (1 << (cntk)))
{
cout << 2 << endl;
return ;
}
int lown = n & ((1 << (cntk)) - 1);
int lowm = m & ((1 << (cntk)) - 1);
int highn = n >> cntk;
int highm = m >> cntk;
bool flag = (tmpk == ((1 << (cntk)) - 1));
if(highn == highm)
{
cout << 2 << endl;
return ;
}
else if(highn < highm)
{
int init = 0;
if(lown == ((1 << (cntk)) - 1)) init = 1;
else if(lown + tmpk >= (1 << (cntk)) - 1 || ((1 << (cntk)) - 2) == lown) init = 2;
else init = 3;
int ans = 0;
if(flag) ans = init + (highm - highn - 1) * 2;
else ans = init + (highm - highn - 1) * 3;
if(lowm == 0) ans = ans;
else if(lowm <= tmpk || lowm == 1) ans = ans + 1;
else ans = ans + 2;
cout << ans << endl;
}
else{
int init = 0;
if(lown == 0) init = 1;
else if(flag || lown == 1) init = 2;
else init = 3;
int ans = 0;
if(flag) ans = init + (highn - highm - 1) * 2;
else ans = init + (highn - highm - 1) * 3;
if(lowm == (1 << (cntk)) - 1) ans = ans;
else if(lowm + tmpk >= (1 << (cntk)) - 1 || lowm == (1 << (cntk)) - 2) ans = ans + 1;
else ans = ans + 2;
cout << ans << endl;
}
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> T;
while(T--)
{
solve();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3532kb
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: 29ms
memory: 3384kb
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 2 137 121 213 213 151 21 81 156 95 95 116 13 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 103 61 93 100 11 6 79 44 63 91 60 22 109 11 4 10 67 11 85 207 47 39 83 156 189 107 27 81 247 81 335 33 145 11 50 54 347 233 175 30 7...
result:
wrong answer 5th numbers differ - expected: '1', found: '2'