QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#243701#6510. Best Carry Player 3Delay_for_five_minutes#WA 13ms3400kbC++201.1kb2023-11-08 16:06:322023-11-08 16:06:33

Judging History

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

  • [2023-11-08 16:06:33]
  • 评测
  • 测评结果:WA
  • 用时:13ms
  • 内存:3400kb
  • [2023-11-08 16:06:32]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a,b,k;
void solve() {
    cin >> a >> b >> k;
    if(a > b) swap(a , b) ;
    if(k == 0) {
        cout << b - a << '\n' ; return ;
    }
    if(a == b) {
        cout << 0 << '\n' ; return ;
    }
    ll d = (1 << __lg(k) + 1) - 1;

    int c = __lg(k) + 1;
    if((b >> c) == (a >> c)) {
        if((a ^ b) <= k) {
            cout << 1 << '\n' ;
        }
        else cout << 2 << '\n' ;
        return ;
    }
    ll a1 = ((a | d) ^ a) ;
    ll ans = 0;
    if(a1 <= k & a1 != 0) ans++ ;
    else if(a1 != 0) ans += 2;

    // cout << a1 <<' ' << ans << '\n' ;
    ans += ((b >> c) - (a >> c)) + ((b >> c) - (a >> c) - 1) * (1 + (k != d)) ;
    // cout << a1 <<' ' << ans << '\n' ;

    ll b1 = ((b | d) ^ d) ^ b;
    // cout << b1 << '\n' ;
    if(b1 <= k && b1 != 0) ans++;
    else if(b1 != 0) ans += 2;
    cout << ans << '\n' ;
}
int main()
{
   // freopen("in.txt","r",stdin) ;
    int t ; 
    ios::sync_with_stdio(false) ; cin.tie(0) ; cout.tie(0) ;
    cin >> t;
    while(t--) solve() ;
}

詳細信息

Test #1:

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

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: 13ms
memory: 3388kb

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'