# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105163 | stefdasca | Hidden Sequence (info1cup18_hidden) | C++14 | 7 ms | 256 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<bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int>findSequence(int N)
{
vector<int> ans (N, 0);
vector<int> qu;
vector<int> qu1;
int nr0 = 0, nr1 = 0;
while(1)
{
qu.push_back(0);
qu1.push_back(1);
if(isSubsequence(qu))
++nr0;
else
{
nr1 = N - nr0;
break;
}
if(isSubsequence(qu1))
++nr1;
else
{
nr0 = N - nr1;
break;
}
}
if(nr0 == N)
return ans;
if(nr0 == 0)
{
for(int j = 0; j < N; ++j)
ans[j] = 1;
return ans;
}
int cntsf0 = 0, cntsf1 = 0;
for(int i = 0; i < N; ++i)
{
qu.clear();
if(cntsf0 <= cntsf1)
for(int j = 0; j <= cntsf0; ++j)
qu.push_back(0);
else
for(int j = 0; j <= cntsf1; ++j)
qu.push_back(1);
if(nr0 <= nr1)
for(int j = 0; j < nr0; ++j)
qu.push_back(0);
else
for(int j = 0; j < nr1; ++j)
qu.push_back(1);
if(isSubsequence(qu))
if(cntsf0 <= cntsf1)
ans[i] = 0, ++cntsf0, --nr0;
else
ans[i] = 1, ++cntsf1, --nr1;
else
if(cntsf0 <= cntsf1)
ans[i] = 1, ++cntsf1, --nr1;
else
ans[i] = 0, ++cntsf0, --nr0;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |