QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#185741#6510. Best Carry Player 3supepapupuWA 18ms3756kbC++171005b2023-09-22 16:03:052023-09-22 16:03:05

Judging History

你现在查看的是最新测评结果

  • [2023-09-22 16:03:05]
  • 评测
  • 测评结果:WA
  • 用时:18ms
  • 内存:3756kb
  • [2023-09-22 16:03:05]
  • 提交

answer

#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

void solve() {
    ll X, Y, K;
    cin >> X >> Y >> K;
    if (X > Y) swap(X, Y);
    if (K <= 1) return cout << Y - X << el, void();
    int n = log2(K);
    ll ans = ((Y >> n + 1) - (X >> n + 1)) * 3;
    if (!ans) {
        if (X == Y) ans = 0;
        else if ((X & Y) <= K) ans = 1;
        else ans = 2;
        cout << ans << el;
        return;
    }
    ll v = (1ll << n + 1) - 1;
    if ((X & v) == v) ans -= 2;
    else if ((X & v) >> n & 1) ans -= 1;
    else if (((X & v) ^ v) <= K) ans -= 1;
    if (Y & v) ++ans;
    if ((Y & v) > K) ++ans;
    // cout << (X & v) << el;
    cout << ans << el;
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int tcase = 1;
    cin >> tcase;
    while (tcase--) solve();
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3632kb

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: 18ms
memory: 3756kb

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
66
59
6
2
137
121
318
213
150
30
81
156
141
95
116
12
6
23
388
57
99
90
36
51
17
270
117
20
56
8
132
203
108
26
15
157
98
165
389
174
123
59
289
78
17
30
53
275
191
17
102
60
93
100
15
6
79
44
63
91
60
22
109
11
3
10
99
11
85
207
47
39
83
156
189
159
27
120
247
120
335
48
144
11
74
54
347
233
261...

result:

wrong answer 2nd numbers differ - expected: '45', found: '66'