제출 #199052

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
199052		Redhood	Binary Subsequences (info1cup17_binary)	C++14	30.10 / 100	1093 ms	376 KiB

binary

#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
using namespace std;
const int inf = 1e9+7;
vector<int> answer(vector<int>x){
    int pos=0;
    vector<int>ans;
    while(x.back()){
        x.pb(x[pos]%(x[pos+1]+1));
        if(x.back()==x[pos+1]){
            ans.pb(inf);
            return ans;
        }
        ans.pb(x[pos]/(x[pos+1]+1));
        ++pos;
    }
    ans.pb(x[pos]/(x[pos+1]+1));
    return ans;
}
pair < int , vector<int> > solve(int k){
    vector<int>currans;
    int len=inf , ans = 0;
    for(int prev=0;prev<=k;++prev){
        if(prev>=k-prev)break;
        ++ans;
        vector<int>tryy={k-prev , prev};
        tryy=answer(tryy);
        int sum=0;for(auto u : tryy)sum+=u;
        if(sum<len){
            len=sum,currans=tryy;
        }
    }
//    cerr<<"ok\n";
    return {ans , currans};
}
signed main(){
    ios_base::sync_with_stdio(0) , cin.tie(0), cout.tie(0);
    int t;cin>>t;
    while(t--){
        int k;cin>>k;
        pair<int,vector<int>>answer=solve(k);
//        if(answer.fi==0){cout<<-1;continue;}
        cout<< -1 << '\n';
        bool bt=0;
        for(auto u : answer.se){
            for(int z=0;z<u;++z)cout<<bt<<' ';
            bt^=1;
        }
        cout<<'\n';
    }
    return 0;
}

• Subtask 1: 30.1 / 43
• Subtask 2: 0 / 39
• Subtask 3: 0 / 18