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