Submission #53029873

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,int> P;
typedef pair<int,P> PP; 
bool dp[65][65][65];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,int> P;
typedef pair<int,P> PP; 


bool dp[65][65][65];

int main(){
    ll a,b,C;
    cin>>a>>b>>C;


    ll c=__builtin_popcountll(C);
    
    if(
        (a+b+c)%2!=0 
    || (-a+b+c)<0 
    || (-a+b+c)%2==1 
    || (a+b+c)>120

    || (a-b+c)<0 
    || (a-b+c)%2==1
    
    || (a+b-c)<0
    || (a+b-c)%2==1){
        cout<<-1<<endl;
        return 0;
    }
    
   /*
    if((a + b + c) % 2 != 0 || a + b + c > 120 || a > b + c || b > c + a || c > a + b){
        cout << -1 << endl;
        return 0;
    }
    */
    
    ll n00=60-(a+b+c)/2;
    ll n01=(-a+b+c)/2;
    ll n10=(a-b+c)/2;
    ll n11=(a+b-c)/2;

    vector<vector<pair<int,int>>> S(2);

    for(int t=1;t<=n11;t++){
        S[0].push_back({1,1});
    }
    for(int t=1;t<=n00;t++){
        S[0].push_back({0,0});
    }

    for(int t=1;t<=n01;t++){
        S[1].push_back({0,1});
    }
    for(int t=1;t<=n10;t++){
        S[1].push_back({1,0});
    }

    ll ansX=0,ansY=0;
    //for(int k=60;k>=0;k--){これはNG
    for(unsigned k=60;k--;){//ループ本体がk=0の時にもチェックされる

        //cout<<"k="<<k<<endl;
        ansX*=2;
        ansY*=2;

        int u=(C>>k)&1;

        auto [x,y]=S[u].back();
        ansX+=x;
        ansY+=y;
        S[u].pop_back();

    }
    cout<<ansX<<" "<<ansY<<endl;
    /*
    cout<<__builtin_popcountll(ansX)<<endl;
    cout<<__builtin_popcountll(ansY)<<endl;
    cout<<((ansX^ansY)==C?1:0)<<endl;
    cout<<"te"<<endl;
    */
}

Submission Info

Judge Result