# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
765487 | Ahmed57 | Hidden Sequence (info1cup18_hidden) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "grader.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> valid(vector<int> ch,int N,int x,int lx,int rx){
if(ch.size()<=(n/2)+1)return ch;
vector<int> vl;
int a = 0 , b = 0;
for(int i = 0;i<ch.size();i++){
if(ch[i]==x){
a++;
}else b++;
}
for(int i = 0;i<rx-b;i++){
vl.push_back(!x);
}for(int i = 0;i<lx-a;i++){
vl.push_back(x);
}
return vl;
}
vector<int>findSequence(int N){
int x= 0;
vector<int>ch;
for(int i = 0;i<N/2+1;i++)ch.push_back(x);
if(isSubsequence(ch))x = 1;
ch.clear();
int cut = 0;
for(int i = 1;i<=N/2+1;i++){
ch.push_back(x);
if(!isSubsequence(ch)){
cut = i-1;
break;
}
}
vector<int> ans(N);
for(int i = 0;i<N;i++)ans[i] = !x;
for(int i = 1;i<=cut;i++){
int l = 0;
ch.clear();
for(int j = 0;j<i;j++)ch.push_back(x);
ch.push_back(!x);
while(isSubsequence(valid(ch,N,x,cut,N-cut)){
l++;
ch.push_back(!x);
if(ch.size()>N){
break;
}
}
long long lol = N-((cut-i)+l);
if(lol<=0){
return {0};
}
ans[lol-1] = x;
}
return ans;
}