QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#303756#6510. Best Carry Player 3AH20WA 19ms3560kbC++141.1kb2024-01-12 23:03:142024-01-12 23:03:15

Judging History

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

  • [2024-01-12 23:03:15]
  • 评测
  • 测评结果:WA
  • 用时:19ms
  • 内存:3560kb
  • [2024-01-12 23:03:14]
  • 提交

answer

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll high(ll x){
    for(int i=62;i>=0;i--){
        int bit = (x >> i) & 1;
        if(bit) return i+1;
    }
    return 0;
}
ll solve(){
    ll x,y,k,ans = 0;
    cin>>x>>y>>k;
    if(x > y) swap(x,y);
    if(k == 0) return y - x;
    ll hk = high(k);
    ll dx = x/(1ll << hk),dy = y/(1ll << hk);
    //100 101 
    ll lowx = x & ((1ll<<hk) - 1),lowy = y & ((1ll<<hk) - 1);
    ll oper = dy - dx;
    //
    //不同组之间的操作次数
    if(k + 1 == (1ll<<hk)) ans += 2 * oper;
    else ans += 3 * oper; 

    if(k+1 != (1ll<<hk) and (((1ll<<hk) - 1)^lowx) <= k) --ans;
    
    if(lowx + 1 == (1ll<<hk)) --ans;
    
    if(ans) lowx = 0;
    
    if(lowx == lowy) ans += 0;
    else if(((lowx ^ lowy) <= k) or abs(lowx - lowy) == 1) ans += 1;
    else ans += 2;
    if(ans == 0 and x != y) cout<<x<<" "<<y<<" "<<k<<endl;
    return ans;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int T;cin>>T;
    while(T--) cout<<solve()<<'\n';
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3560kb

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

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 220th numbers differ - expected: '1', found: '17'