# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1235809 | Aisha | Hidden Sequence (info1cup18_hidden) | C++20 | 5 ms | 408 KiB |
#include "bits/stdc++.h"
#include "grader.h"
using namespace std;
bool isS(vector <int> a, vector <int> b) {
int i = 0, j = 0;
int n = a.size(), m = b.size();
while (i < n && j < m) {
if (a[i] == b[j]) {
i ++; j ++;
} else i ++;
}
return (j == m);
}
vector <int> findSequence(int n) {
int m = n / 2 + 1;
for (int mask = (1 << n) - 1; mask >= 0; mask --) {
vector <int> a;
for (int i = 0; i < n; i ++) a.push_back((mask & (1 << i)) > 0);
bool ok = true;
for (int mask1 = 1; mask1 < (1 << m); mask1 ++) {
vector <int> b;
for (int i = 0; i < m; i ++) {
if (mask1 & (1 << i)) b.push_back(1);
else b.push_back(0);
}
ok &= (isSubsequence(b) == isS(a, b));
if (ok == false) break;
}
if (!ok) continue;
return a;
}
return {0};
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |