Submission #1789773


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) (y<0||x<0||y>=h||x>=w)
#define dump(...)
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
#define INF (1001001001)
#define INFLL (1001001001001001001ll)
template<class T> ostream& operator << (ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v)) os<<*i<<(i==end(v)-1?"":" "); return os; }
template<class T> istream& operator >> (istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i; return is; }
template<class T> istream& operator >> (istream &is, pair<T,T> &p) {
    is>>p.first>>p.second; return is; }
template <class T> bool chmax(T &a,const T &b) {if(a<b) {a=b;return 1;} return 0;}
template <class T> bool chmin(T &a,const T &b) {if(b<a) {a=b;return 1;} return 0;}
template <class T> using heap = priority_queue<T,vector<T>,greater<T>>;
struct before_main_function {
    before_main_function() {
        #ifdef int
            #undef INF
            #define INF INFLL
            #define stoi stoll
        #endif
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(15)<<fixed;
        #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

int N;
string dp[61][2][250];
string dfs(int i,int c,int pop) {
    if(dp[i][c][pop+125]!="#") return dp[i][c][pop+125];
    if(i==60) {
        if(pop==0) {
            return dp[i][c][pop+125]="";
        } else {
            return dp[i][c][pop+125]="~";
        }
    }
    string ret="~";
    REP(j,2) {
        int x=j;
        int x_n=((N&(1<<i))>>i)+x+c;
        string t=dfs(i+1, x_n/2, pop+x-(x_n%2));
        if(t!="~") {
            t+='0'+x;
            chmin(ret,t);
        }
    }
    return dp[i][c][pop+125]=ret;
}
signed main() {
    int T;
    cin>>T;
    while(T--) {
        REP(i,61) REP(j,2) REP(k,250) dp[i][j][k]="#";
        cin>>N;
        string s=dfs(0,0,0);
        if(s=="~") {
            cout<<-1<<endl;
            continue;
        }
        int ans=0;
        REP(i,60) {
            if(s[59-i]=='1') ans|=(1<<i);
        }
        cout<<ans<<endl;
    }
    return 0;
}

Submission Info

Submission Time
Task H - Bit Count
User algon
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2606 Byte
Status RE
Exec Time 102 ms
Memory 2048 KB

Judge Result

Set Name All
Score / Max Score 0 / 300
Status
AC × 5
RE × 4
Set Name Test Cases
All 00_sample.txt, 10_small_00.txt, 20_medium_01.txt, 20_medium_02.txt, 20_medium_03.txt, 30_large_04.txt, 30_large_05.txt, 30_large_06.txt, 80_power_of_2.txt
Case Name Status Exec Time Memory
00_sample.txt AC 5 ms 1920 KB
10_small_00.txt AC 61 ms 1920 KB
20_medium_01.txt AC 68 ms 2048 KB
20_medium_02.txt AC 75 ms 2048 KB
20_medium_03.txt AC 69 ms 2048 KB
30_large_04.txt RE 100 ms 1920 KB
30_large_05.txt RE 102 ms 1920 KB
30_large_06.txt RE 101 ms 1920 KB
80_power_of_2.txt RE 100 ms 1920 KB