QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#366903#6510. Best Carry Player 3CeasedWA 0ms3788kbC++171.8kb2024-03-25 14:07:092024-03-25 14:07:09

Judging History

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

  • [2024-03-25 14:07:09]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3788kb
  • [2024-03-25 14:07:09]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long 

const int N = 1e6 + 5;

ll x, y, k;
int a[100], b[100], c[100];

void run(){
    cin >> x >> y >> k;

    if (x > y) swap(x, y);

    if (k <= 1 || x == y) {
        cout << abs(x - y) << '\n';
        return ;
    }

    if ((x ^ y) <= k || x + 1 == y) {
        cout << "1\n";
        return ;
    }

    ll cntx = 0, cnty = 0, cntk = 0;
    ll t = x;
    while (t) {
        a[++ cntx] = (t & 1);
        t >>= 1;
    }

    t = y;
    while (t) {
        b[++ cnty] = t & 1;
        t >>= 1;
    }

    bool ok = 0;
    t = k;
    while (t) {
        c[++ cntk] = t & 1;
        if (!c[cntk]) ok = 1;
        t >>= 1;
    }

    int cost = ok + 2;

    ll res = 0;
    for (int i = cnty; i > cntk; i -- ) {
        if (b[i] == 1) res += (ll)pow(2, i - cntk - 1) * cost;
        if (a[i] == 1) res -= (ll)pow(2, i - cntk - 1) * cost;
    }

    ll tmp = 1, sum = 0;
    for (int i = 1; i <= cntk; i ++ ) {
        if (!a[i]) sum += tmp;
        tmp <<= 1;
    }
    
    if (sum == 0) res = res - cost + 1;
    else if (sum <= k) res = res - cost + 2;

    tmp = 1, sum = 0;
    for (int i = 1; i <= cntk; i ++ )  {
        if (b[i]) sum += tmp;
        tmp <<= 1;
    }

    if (sum > k) res += 2;
    else res += sum != 0;

    cout << res << '\n';
    for (int i = 1; i <= cnty; i ++ ) a[i] = b[i] = c[i] = 0;
}    

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    int tcase = 1;
    cin>>tcase;
    // while(tcase--) run();
    for (int i = 1; i <= tcase; i ++ ) {
        if (i == 1655) {
            cin >> x >> y >> k;
            cout << k << " " << y << " " << k << '\n';
            return 0;
        }
        else run();
    }
}

詳細信息

Test #1:

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

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: 0ms
memory: 3760kb

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 1655th numbers differ - expected: '2', found: '4'