QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#355985#6510. Best Carry Player 3x_jw#WA 19ms3672kbC++141.2kb2024-03-17 14:26:212024-03-17 14:26:23

Judging History

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

  • [2024-03-17 14:26:23]
  • 评测
  • 测评结果:WA
  • 用时:19ms
  • 内存:3672kb
  • [2024-03-17 14:26:21]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
using namespace std;
using ll=long long;
using db=double;
using pii=pair<int,int>;
#define pb push_back
#define endl "\n"

void solve()
{
    ll x, y, k;
    cin>>x>>y>>k;
    bitset<62>xx(x), yy(y), kk(k);
    int m = 61;
    while(m>=0 && kk[m]==0) m--;
    m++;
    ll d=-(x>>m)+(y>>m), ans=0;
    if(d>0){
        //先变全1
        ll m1=(1<<m)-1;
        ll sub=m1^(m1&x);
        if(sub<=k&&sub) ans++;
        else if(sub>k) ans+=2;
        ans++, d--;
        ll bs=0;
        if(k==m1) bs=2;
        else bs=3;
        ans+=bs*d;
        x=0;
    }
    else if(d<0){
        //先全变0
        ll m1=(1<<m)-1;
        ll sub=m1&x;
        if(sub<=k&&sub) ans++;
        else if(sub>k) ans+=2;
        ans++, d++;
        ll bs=0;
        if(k==m1) bs=2;
        else bs=3;
        ans-=bs*d;
        x=m1;
    }
    //printf("%lld===\n", ans);
    ll m1=(1<<m)-1;
    y = y&m1;
    ll cost=x^y;
    if(cost<=k&&cost) ans++;
    else if(cost>k) ans+=2;
    cout<<ans<<endl;
}

signed main()
{
    #ifdef ONLINE_JUDGE
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    #endif
    int _=1;
    cin>>_;
    while(_--) solve();
    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 1ms
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: 3568kb

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
117
6
2
273
241
213
213
150
21
81
156
95
95
116
12
6
16
775
39
67
90
71
35
17
270
79
20
56
6
89
203
215
26
29
157
98
111
389
174
123
117
289
155
33
21
36
275
381
17
102
60
93
100
11
6
79
44
63
91
60
22
109
21
3
10
67
11
85
207
47
39
83
156
189
107
27
81
247
81
669
33
144
11
50
54
347
233
175
3...

result:

wrong answer 3rd numbers differ - expected: '59', found: '117'