QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#120028 | #6510. Best Carry Player 3 | exxqfu | WA | 8ms | 1748kb | C++14 | 1.6kb | 2023-07-06 11:45:53 | 2023-07-06 11:45:54 |
Judging History
answer
#include <cstdio>
#define rep(i, d, u) for(int i = d; i <= u; ++i)
#define cep(n) while(n--)
int ured() {
int re = 0;
char ch;
do {
ch = getchar();
} while('9' < ch || ch < '0');
do {
re = re * 10 + (ch ^ '0');
} while('0' <= (ch = getchar()) && ch <= '9');
return re;
}
long long lred() {
long long re = 0;
char ch;
do {
ch = getchar();
} while('9' < ch || ch < '0');
do {
re = re * 10 + (ch ^ '0');
} while('0' <= (ch = getchar()) && ch <= '9');
return re;
}
void lwit(long long da) {
int ch[21], cn = 0;
do {
ch[++cn] = da - da / 10 * 10;
} while(da /= 10);
do {
putchar('0' ^ ch[cn]);
} while(--cn);
}
void swap(long long &le, long long &ri) {
long long tp = le;
le = ri, ri = tp;
}
int t, dpos, ddat;
long long x, y, s, rans;
int main() {
t = ured();
cep(t) {
x = lred(), y = lred(), s = lred();
if(x == y) {
puts("0");
continue;
} else if(x > y) {
swap(x, y);
}
if(s > 1) {
dpos = 64 - __builtin_clzll(s);
if((x ^ y) >> dpos) {
if(s == (1ll << dpos) - 1) {
rans = (y >> dpos) - (x >> dpos) - 1 << 1;
} else {
rans = ((y >> dpos) - (x >> dpos) - 1) * 3;
}
++rans;
if(ddat = x & (1ll << dpos) - 1 ^ (1ll << dpos) - 1) {
if(ddat <= s) {
++rans;
} else {
rans += 2;
}
}
if(ddat = y & (1ll << dpos) - 1) {
if(ddat <= s) {
++rans;
} else {
rans += 2;
}
}
lwit(rans), putchar('\n');
} else {
if((x ^ y) <= s) {
puts("1");
} else {
puts("2");
}
}
} else {
lwit(y - x), putchar('\n');
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 1748kb
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: 8ms
memory: 1484kb
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'