| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 67146 | MrTEK | Hidden Sequence (info1cup18_hidden) | C++14 | 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<bits/stdc++.h>
#include "grader.h"
using namespace std;
#define mp make_pair
#define pb push_back
#define len(a) (int)a.size()
#define fi first
#define sc second
#define d1(w) cerr<<#w<<":"<<w<<endl;
#define d2(w,c) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<endl;
#define d3(w,c,z) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<" "<<#z<<":"<<z<<endl;
#define left ind+ind
#define right ind+ind+1
#define mid (l+r)/2
#define FAST_IO ios_base::sync_with_stdio(false);
#define endl '\n'
const int maxn = 620;
const long long LINF = 1e18;
const int LOG = 31;
const int INF = 1e9;
const int N = 1e3 + 5;
const int M = 4;
const int SQ = 350;
const int MOD = 998244353;
using namespace std;
static int maxQ = 0;
static vector < int > theRealAnswer;
bool isSubsequence (vector < int > v)
{
if (v.size () > maxQ)
maxQ = v.size ();
int i = 0;
for (auto it : v)
{
while (i < theRealAnswer.size () && it != theRealAnswer[i]) i ++;
if (i == theRealAnswer.size ()) return 0;
i ++;
}
return 1;
}
vector < int > findSequence (int N)
{
vector < int > ans (N, 0),sif,v;
for (int i = 0 ; i < N ; i++) {
sif.pb(0);
if (isSubsequence(sif) == false) {sif.pop_back();break;}
}
if (len(sif) == N) {
for (int i = 0 ; i < N ; i++) ans[i] = sif[i];
return ans;
}
else if(len(sif) == 0) {
for (int i = 0 ; i < N ; i++) ans[i] = 1;
return ans;
}
for (int i = 0 ; i < N ; i++) {
v.clear();
for (int j = 0; j < i ; j++) v.pb(ans[j]);
v.pb(1);
for (int j = 0 ; j < len(sif) ; j++) v.pb(sif[j]);
if (len(v) > N) {
for (int j = i ; j < N ; j++) ans[i] = 0;
break;
}
// printf("%d ------>",i + 1);
// for (auto j : v) printf("%d ",j);
// puts("");
if (isSubsequence(v)) {
ans[i] = 1;
continue;
}
else {
ans[i] = 0;
sif.pop_back();
}
}
return ans;
}
int main ()
{
int n, x;
scanf ("%d", &n), maxQ = 0;
for (int i=1; i<=n; i++)
scanf ("%d", &x), theRealAnswer.push_back (x);
vector < int > ans = findSequence (n);
if (ans.size () != theRealAnswer.size ())
{
printf ("Different lengths\n");
for (auto it : ans)
printf ("%d ", it);
printf ("\n");
return 0;
}
for (int i=0; i<ans.size (); i++)
if (ans[i] != theRealAnswer[i])
{
printf ("WA position %d\n", i + 1);
for (auto it : ans)
printf ("%d ", it);
printf ("\n");
return 0;
}
printf ("Ok, biggest queried length %d\n", maxQ);
return 0;
}