QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#366872#6510. Best Carry Player 3CeasedWA 19ms3676kbC++171.9kb2024-03-25 12:12:312024-03-25 12:12:31

Judging History

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

  • [2024-03-25 12:12:31]
  • 评测
  • 测评结果:WA
  • 用时:19ms
  • 内存:3676kb
  • [2024-03-25 12:12:31]
  • 提交

answer

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

#define int long long

const int N = 1e6 + 5;

int a,b,k,sa,sb,sk,ans;

vector<int> A;
vector<int> B;
vector<int> K;

void run()
{
    A.clear();B.clear();K.clear();
    cin>>a>>b>>k;
    if (a> b) swap(a, b);

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

    if ((a ^ b) <= k || a + 1 == b) {
        cout << "1\n";
        return ;
    }
    ans = 0;
    if(a<b){
        while(b){
            B.push_back(b%2);
            b/=2;
            A.push_back(a%2);
            a/=2;
        }
        while(k){
            K.push_back(k%2);
            k/=2;
        }
        // reverse(A.begin(),A.end());reverse(B.begin(),B.end());reverse(K.begin(),K.end());
        sa=A.size(),sb=B.size(),sk=K.size();int f=0,c=2,x=0,y=0;
        
        for(int i=sk-1;i>=0;i--){
            x*=2;x+=A[i];
            y*=2;y+=K[i];
            f*=2;f+=1;
            if(K[i]==0)c*=0;
        }
        if(x==f)ans++;else if((f^x)<=y)ans+=2;else ans+=3;

        // cout<<x<<" "<<(f^x)<<" "<<y<<'\n';
        // cout<<ans<<'\n';
        if(c==0)c=3;
        x=0,y=0;A[sk]++;
        for(int i=sb-1;i>=sk;i--){
            x*=2;x+=B[i];
            if(i<sa)y*=2;y+=A[i];
            
            // cout<<B[i]<<" ";
        }
        x-=y;ans+=x*c;
        // cout<<x<<"\n";
        // cout<<c<<'\n';
        // cout<<ans<<'\n';                                       
        x=0,y=0;
        for(int i=sk-1;i>=0;i--){
            x*=2;x+=B[i];
            y*=2;y+=K[i];
        }
        // cout<<x<<" "<<y<<'\n';
        if(x==0)ans=ans;else if(x<=y)ans++;else ans+=2;
        cout<<ans<<'\n';

    }
}

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

    int tcase = 1;
    cin >> tcase;
    while (tcase--)
        run();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 19ms
memory: 3676kb

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: '1'