# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105146 | stefdasca | Hidden Sequence (info1cup18_hidden) | C++14 | 5 ms | 304 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;
vector<int> qu;
vector<int> qu1;
int stp = 0, nr0 = 0, nr1 = 0;
while(1)
{
qu.push_back(0);
qu1.push_back(1);
if(!isSubsequence(qu))
{
nr1 = N - stp;
nr0 = stp;
break;
}
if(isSubsequence(qu1))
{
nr1 = stp;
nr0 = N - stp;
break;
}
++stp;
}
int cntsf0 = 0, cntsf1 = 0;
for(int i = 0; i < N; ++i)
{
qu.clear();
if(nr0 <= nr1)
{
for(int j = 0; j < cntsf0; ++j)
qu.push_back(0);
qu.push_back(1);
for(int j = cntsf0; j < nr0; ++j)
qu.push_back(0);
if(isSubsequence(qu))
ans.push_back(1);
else
ans.push_back(0), ++cntsf0;
}
else
{
for(int j = 0; j < cntsf1; ++j)
qu.push_back(1);
qu.push_back(0);
for(int j = cntsf1; j < nr1; ++j)
qu.push_back(1);
if(isSubsequence(qu))
ans.push_back(0);
else
ans.push_back(1), ++cntsf1;
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |