Submission #1770214

---

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>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

int b=150;
int dp[66][333][2];
void solve(){
    int latte;cin>>latte;
    string s;

    rep(i,60)s+=(latte>>i&1)+'0';

    fill_n(**dp,66*333*2,LLONG_MAX);
    dp[0][b][0]=0;

    rep(i,60){
        for(int j=-60;j<=60;j++){
            rep(k,2){
                if(dp[i][j+b][k]==LLONG_MAX)continue;
                rep(l,2){
                    int n=(k+l+s[i]-'0')%2;
                    chmin(dp[i+1][j+b+n-l][(k+l+s[i]-'0')>=2],dp[i][j+b][k]+(l<<i));
                }
            }
        }
    }

    cout<<dp[60][b][0]<<endl;
}

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

Submission Info

Judge Result