QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#197743#6510. Best Carry Player 3DepletedPrism#WA 16ms3684kbC++171.7kb2023-10-02 19:11:472023-10-02 19:11:47

Judging History

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

  • [2023-10-02 19:11:47]
  • 评测
  • 测评结果:WA
  • 用时:16ms
  • 内存:3684kb
  • [2023-10-02 19:11:47]
  • 提交

answer

/*
* @Author: zxxzy
* @Date:   2023-07-20 15:10:02
*/
#include <iostream>
#include <algorithm>
#include <cstring>
#include <bitset>
#include <set>
#include <cmath>
#include <vector>
#include <map>
#define int long long
#define space ' '
#define endl '\n'
#define de(x) cout<<"** "<<x<<" **"<<endl;
#define N 200005
using namespace std;
using ll=long long;
const int mod=998244353;
const int INF=0x3f3f3f3f;
const double eps=1e-6;


signed main(){
    #ifdef LOCAL
        freopen("D:\\code2023\\test\\input.txt", "r", stdin);
        freopen("D:\\code2023\\test\\output.txt", "w", stdout);
    #endif
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin>>T;
    while(T--){
        int x,y,k;
        cin>>x>>y>>k;
        if(x>y){
            swap(x,y);
        }
        if(k<=1){
            cout<<y-x<<endl;
            continue;
        }
        int base=1;
        while(base<=k){
            base<<=1;
        }
        int ans=0;
        int xy=y/(base)-(x+base-1)/(base);
        if(k!=base-1){
            ans+=xy*3;
        }else{
            ans+=xy*2;
        }

        if(y/base==x/base){
            if(y==x){
                cout<<0<<endl;
            }else if((y^x)<=k){
                cout<<1<<endl;
            }else{
                cout<<2<<endl;
            }
            continue;
        }
        if(x%base==0){

        }else if(x%base==base-1){
            ans+=1;
        }else if(x%base<base-1-k){
            ans+=3;
        }else{
            ans+=2;
        }
        if(y%base==0){

        }else if(y%base<=k){
            ans+=1;
        }else{
            ans+=2;
        }
        cout<<ans<<endl;
    }

    return 0;
}



Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 3628kb

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'