QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #148010 | #6510. Best Carry Player 3 | ClapEcho233 | WA | 13ms | 3640kb | C++14 | 1.9kb | 2023-08-23 14:54:19 | 2023-08-23 20:15:37 |
Judging History
answer
#include <bits/stdc++.h>
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
#define ll long long
#define CI const int
#define RI int
#define W while
#define gc getchar
#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)<(y)?(x):(y))
#define Mt(a,x) memset((a),(x),sizeof(a))
using namespace std;
namespace SlowIO {
void Readc (char& c) {W (isspace (c = gc ()));}
Tp void Read (Ty& x) {char c; int f = 1; x = 0; W (! isdigit (c = gc ())) f = c ^ '-' ? 1 : -1; W (x = (x * 10) + (c ^ 48), isdigit (c = gc ())); x *= f;}
Ts void Read (Ty& x, Ar&... y) {Read (x); Read (y...);}
} using namespace SlowIO;
#define ull unsigned ll
int T; ull X, Y, K;
ull Abs (ull x, ull y) {return x >= y ? x - y : y - x;}
int main () {
RI i, j; Read (T); W (T --) {
Read (X, Y, K); int Kid = 0, Xid = 0, Yid = 0; ull kk = K, xx = X, yy = Y; W (kk) ++ Kid, kk >>= 1; W (xx) ++ Xid, xx >>= 1; W (yy) ++ Yid, yy >>= 1;
ull cnt = Abs (X >> Kid, Y >> Kid); if (K == 0 || K == 1) {printf ("%llu\n", Abs (X, Y)); continue;}
if (cnt == 0) {if ((X ^ Y) >= K) printf ("2\n"); else printf ("1\n"); continue;} ull ans = 0; if (X < Y) {
ull now = (((1ull << Kid) - 1ull) ^ (X & ((1ull << Kid) - 1ull))); if (now == 0) ans += 1; else if (now <= K) ans += 2; else ans += 3; -- cnt;
if (K == (1ull << Kid) - 1) ans += cnt * 2; else ans += cnt * 3; now = (Y & ((1ull << Kid) - 1ull));
if (now == 0) ans += 0; else if (now <= K) ans += 1; else ans += 2;
} else {
ull now = (X & ((1ull << Kid) - 1ull)); if (now == 0) ans += 1; else if (now <= K) ans += 2; else ans += 3; -- cnt;
if (K == (1ull << Kid) - 1) ans += cnt * 2; else ans += cnt * 3; now = (((1ull << Kid) - 1ull) ^ (Y & ((1ull << Kid) - 1ull)));
if (now == 0) ans += 0; else if (now <= K) ans += 1; else ans += 2;
} printf ("%llu\n", ans);
}
return 0;
}
// X & ((1ull << Kid) - 1ull)
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3640kb
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: 13ms
memory: 3600kb
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 598th numbers differ - expected: '1', found: '2'