QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#350196	#6510. Best Carry Player 3	LittleXi^#	TL	1ms	3704kb	C++20	3.0kb	2024-03-10 15:15:21	2024-03-10 15:15:23

Judging History

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

[2024-03-10 15:15:23]
评测

测评结果：TL
用时：1ms
内存：3704kb

查看

[2024-03-10 15:15:21]
提交

answer

#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define endl "\n"

ll X,Y,K;

void solve1()
{
    int b = 60;
    while((K & (1ll << b)) == 0) --b;
    ll ans = 0;
    while((Y >> (b+1)) - (X >> (b+1)) > 0)
    {
        if((X & K) == K) ++ans, ++X;
        else
        {
            ans += 2; X = (X | K) + 1;
        }
    }
    if(X != Y) ++ans;
    cout << ans << endl;
}

void solve2()
{
    int b = 60;
    while((K & (1ll << b)) == 0) --b;
    ll ans = 0;
    while((Y >> b) - (X >> b) > 1)
    {
        //printf("now X=%d, ans=%d\n",X,ans);
        if(X & (1ll << b))
        {
            ll mask = (1ll << b) - 1;
            if((X & mask) == mask)
            {
                ++ans; ++X;
            }
            else
            {
                ans += 2; X = (X | mask) + 1;
            }
        }
        else
        {
            ll mask = (1ll << (b+1)) - 1;
            if(((X & mask) ^ mask) <= K)
            {
                ans += 1; X |= mask;
            }
            else
            {
                X |= (1ll << b); ++ans;
            }
            // ll mask = (1ll << (b+1)) - 1;
            // if(((X & mask) ^ mask) <= K)
            // {
            //     ans += 2;
            //     X = (X | mask) + 1;
            // }
            // else
            // {
            //     mask = (1ll << b) - 1;
            //     if((X & mask) == mask)
            //     {
            //         ++ans; ++X;
            //     }
            //     else
            //     {
            //         ans += 2; X = (X | mask) + 1;
            //     }
            // }
        }
        //printf("now X=%d, ans=%d\n",X,ans);
    }
    if(X == Y)
    {
        cout << ans << endl;
        return;
    }
    if((X >> b) == (Y >> b))
    {
        cout << ans+1 << endl;
        return;
    }
    if((X ^ Y) <= K)
    {
        cout << ans+1 << endl;
        return;
    }
    if(X + 1 == Y)
    {
        cout << ans+1 << endl;
        return;
    }
    if(X & (1ll << b))
    {
        ll mask = (1ll << b) - 1;
        if((Y & mask) == 0)
        {
            cout << ans+2 << endl;
        }
        else if((X & mask) == mask)
        {
            cout << ans+2 << endl;
        }
        else
        {
            cout << ans+3 << endl;
        }
        return;
    }
    cout << ans+2 << endl;
}

void solve(){
    cin >> X >> Y >> K;
    if(X == Y) {cout << 0 << endl; return;}
    if(K == 1) {cout << abs(X-Y) << endl; return;}
    if(X > Y) swap(X, Y);
    if(X + 1 == Y) {cout << 1 << endl; return;}
    if((X ^ Y) <= K) {cout << 1 << endl; return;}
    ll tmpK = K + 1;
    if((tmpK & (-tmpK)) == tmpK)
    {
        solve1();        
    }
    else
    {
        solve2();
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t;cin>>t;
    while(t--)
        solve();
}

/*

*/

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 1ms

memory: 3704kb

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

Time Limit Exceeded

input: