QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#108784#6510. Best Carry Player 3ckiseki#WA 25ms3536kbC++201.9kb2023-05-26 17:24:422023-05-26 17:24:47

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-05-26 17:24:47]
  • 评测
  • 测评结果:WA
  • 用时:25ms
  • 内存:3536kb
  • [2023-05-26 17:24:42]
  • 提交

answer

#include <bits/stdc++.h>
#ifdef CKISEKI
#define safe cerr<<__PRETTY_FUNCTION__\
    <<" line "<<__LINE__<<" safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
using std::cerr;
template <typename ...T>
void debug_(const char *s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L)
        cerr << (f++ ? ", " : "") << *L;
    cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) ((void)0)
#define orange(...) ((void)0)
#endif

using namespace std;

signed main() {
    cin.tie(nullptr) -> sync_with_stdio(false);
    int T;
    cin >> T;

    while (T--) {
        int64_t X, Y, K;
        cin >> X >> Y >> K;
        if (X < Y) swap(X, Y);
        if (K == 0) {
            cout << X - Y << '\n';
            continue;
        }

        const int c = __lg(K) + 1;
        const int mask = (1 << c) - 1;

        int64_t sX = X >> c;
        int64_t sY = Y >> c;
        debug(sX, sY, c);
        if (sX == sY) {
            if ((X ^ Y) <= K) {
                cout << 1 << '\n';
            } else {
                cout << 2 << '\n';
            }
            continue;
        }

        debug(X, Y);
        int64_t ans = 0;
        if (X & mask) {
            // adjust X to sX << c
            if ((X & mask) <= K) {
                ans += 1;
            } else {
                ans += 2;
            }
        }
        debug(bitset<5>(X));
        debug(bitset<5>(Y));
        debug(X & mask, ans);

        ans += (sX - sY - 1) * (K == mask ? 2 : 3);
        // now sX = sY + 1
        // X = sX << c
        // we can always use 1 operation to reach Y
        ans += 1;
        ans += ((Y & mask) ^ mask) > 0;
        ans += ((Y & mask) ^ mask) > K;

        cout << ans << '\n';

    }
}

詳細信息

Test #1:

score: 100
Accepted
time: 2ms
memory: 3536kb

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: 25ms
memory: 3368kb

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'