Submission #672855

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define int long long
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}

int N;
int dp[61][200][2];

void solve(){
    cin>>N;
    fill_n(**dp,61*200*2,LLONG_MAX);
    dp[0][100][0]=0;

    rep(i,60)rep(j,200)rep(k,2){
        if(dp[i][j][k]==LLONG_MAX)continue;
        rep(l,2){
            int tmp=N>>i&1;
            int up=(tmp+k+l)/2;
            int now=(tmp+k+l)%2;
            chmin(dp[i+1][j+l-now][up],dp[i][j][k]|(l<<i));
        }
    }

    if(dp[60][100][0]==LLONG_MAX)cout<<-1<<endl;
    else cout<<dp[60][100][0]<<endl;
}


signed main(){
    int T;cin>>T;
    while(T--)solve();
    return 0;
}

Submission Info

Judge Result