# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
317093 | casperwang | 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"
#define pb push_back
using namespace std;
vector <int> findSequence (int N) {
vector <int> G, T;
for (int i = 1; i <= N/2+1; i++) {
G.pb(0);
if (!isSubsequence(G)) {
cnt0 = i-1, cnt1 = N-(i-1);
break;
}
}
G.clear();
for (int i = 1; i <= N/2+1; i++) {
G.pb(1);
if (!isSubsequence(G)) {
cnt1 = i-1, cnt0 = N-(i-1);
break;
}
}
int o = (cnt1 < cnt0), len = min(cnt1, cnt0);
vector <int> p(len+1);
for (int i = 0; i <= len; i++) {
for (int j = 1; j <= N; j++) {
G.clear();
for (int k = 0; k < i; k++) G.pb(o);
for (int k = 0; k < j; k++) G.pb(!o);
for (int k = 0; k < len-i; k++) G.pb(o);
if (!isSubsequence(G)) {
p[i] = j-1;
break;
}
}
}
G.clear();
for (int i = 0; i <= len; i++) {
if (i) G.pb(o);
for (int j = 0; j < p[i]; j++) G.pb(!o);
}
return G;
}