| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 67135 | 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 < vector <int> > allvec[2];
vector <vector <int> > seq;
int sz[2];
bool fl;
vector <int > v;
vector <int> vec;
void dfs(int step,int w) {
if (step > sz[w]) {
allvec[w].pb(v);
return;
}
for (int i = 0 ; i < 2 ; i++) {
v.pb(i);
dfs(step + 1,w);
v.pop_back();
}
}
bool my_isSubsequence (vector < int > v, vector <int> v2) {
int i = 0;
for (auto it : v)
{
while (i < len(v2) && it != v2[i]) i ++;
if (i == len(v2)) return 0;
i ++;
}
return 1;
}
void last_dfs(int x,int y,vector <int> v) {
if (y == sz[0]) {
fl = fl & isSubsequence(vec);
return;
}
if (x == sz[1] - 1) {
return;
}
vec.pb(v[x + 1]);
last_dfs(x + 1, y + 1,v);
vec.pop_back();
last_dfs(x + 1,y,v);
}
bool check(vector <int> v) {
fl = true;
last_dfs(-1,0,v);
return fl;
}
vector < int > findSequence (int N)
{
vector < int > ans (N, 0);
if (N > 10) exit(0);
sz[0] = N / 2 + 1;
sz[1] = N;
dfs(1,0);
dfs(1,1);
for (int i = 0 ; i < len(allvec[0]) ; i++) {
if (isSubsequence(allvec[0][i])) {
seq.pb(allvec[0][i]);
}
}
for (int i = 0 ; i < len(allvec[1]) ; i++) {
bool flag = true;
for (int j = 0 ; j < len(seq); j++) {
if (my_isSubsequence(seq[j],allvec[1][i]) == false) {
flag = false; break;
}
}
if (flag && check(allvec[1][i])) {
for (int j = 0 ; j < N ; j++) ans[j] = allvec[1][i][j];
break;
}
}
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;
}