QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#544452#6510. Best Carry Player 3propaneWA 16ms3652kbC++201.2kb2024-09-02 16:51:172024-09-02 16:51:17

Judging History

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

  • [2024-09-02 16:51:17]
  • 评测
  • 测评结果:WA
  • 用时:16ms
  • 内存:3652kb
  • [2024-09-02 16:51:17]
  • 提交

answer

#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int T;
    cin >> T;
    while(T--){
        LL x, y, k;
        cin >> x >> y >> k;
        if (x > y) swap(x, y);
        if (k <= 1){
            cout << y - x << '\n';
            continue;
        }
        int t = __lg(k);
        LL pow2 = 1LL << (t + 1);
        LL ans = 0;
        if (x / pow2 != y / pow2){
            LL target = (x / pow2 + 1) * pow2;
            if (x == target - 1) ans += 1;
            else if (((target - 1) ^ x) <= k) ans += 2;
            else ans += 3;
            x = target;
        }
        if (x / pow2 != y / pow2){
            LL need = y / pow2 - x / pow2;
            if (k == pow2 - 1) ans += 2 * need;
            else ans += 3 * need;
            x = y / pow2 * pow2;
        }
        if (x == y) ans += 0;
        else if ((x ^ y) <= k) ans += 1;
        else ans += 2;
        cout << ans << '\n';
    }

}

詳細信息

Test #1:

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

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: 16ms
memory: 3588kb

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'