QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#303571#6510. Best Carry Player 3KyoomaWA 17ms3620kbC++201.3kb2024-01-12 18:59:192024-01-12 18:59:20

Judging History

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

  • [2024-01-12 18:59:20]
  • 评测
  • 测评结果:WA
  • 用时:17ms
  • 内存:3620kb
  • [2024-01-12 18:59:19]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;
#define dbg(x...) \
    do { \
        cout << #x << " -> "; \
        err(x); \
    } while (0)

void err() {
    cout << endl;
}

template<class T, class... Ts>
void err(T arg, Ts &... args) {
    cout << arg << ' ';
    err(args...);
}

typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 10, Log = 20, inf = 0x3f3f3f3f;

ll x2y(ll x, ll y, ll k){
    if(x == y) return 0;
    ll r = x ^ y;
    if(r <= k) return 1;
    return 2;
}

void solve() {
    ll x, y, k;
    cin >> x >> y >> k;
    if(x > y) swap(x, y);
    int p = 60;
    for(ll i = 0, q = 1; i < 60; i++, q <<= 1){
        if(q > k){
            p = i;
            break;
        }
    }
    ll px = x >> p, py = y >> p;
    ll t = (1ll << p) - 1;
    ll qx = x & t, qy = y & t;
    if(px == py){
        cout << x2y(qx, qy, k) << "\n";
        return;
    }
    // px < py
    ll ans = x2y(qx, t, k) + 1;
    px++;
    ll r = x2y(0, t, k) + 1;
    ans += (py - px) * r;
    ans += x2y(0, qy, k);
    cout << ans << "\n";
}

int main() {
    int T = 1;
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin >> T;
    while (T--) solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3340kb

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: 17ms
memory: 3620kb

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'