# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
128827 | mohammedehab2002 | Hidden Sequence (info1cup18_hidden) | C++11 | 1079 ms | 524292 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 <vector>
using namespace std;
vector<int> v(int a,int b,int c,int d)
{
vector<int> ret;
while (a--)
ret.push_back(b);
while (c--)
ret.push_back(d);
return ret;
}
int cz[205];
vector<int> findSequence(int n)
{
vector<int> z,o;
int cnt=0;
while (isSubsequence(z) && isSubsequence(o))
{
z.push_back(0);
o.push_back(1);
}
if (isSubsequence(z))
cnt=o.size()-1;
else
cnt=n-z.size()+1;
for (int i=1;i<=cnt;i++)
{
int j=1;
for (;i+j<=n/2+1;j++)
{
if (!isSubsequence(v(i,1,j,0)))
break;
}
int k=1;
for (;cnt-i+1+k<=n/2+1;k++)
{
if (!isSubsequence(v(k,0,cnt-i+1,1)))
break;
}
if (i+j<=n/2+1)
cz[n-cnt-j+1]++;
else
cz[k-1]++;
}
vector<int> ans;
for (int i=0;ans.size()!=n;i++)
{
while (cz[i]--)
ans.push_back(1);
ans.push_back(0);
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |