# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1236352 | khome | Hidden Sequence (info1cup18_hidden) | C++20 | 1 ms | 408 KiB |
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
vector <int> findSequence (int n)
{
vector <int> ans (n, 0);
// int ones = 0, zero = 0;
// vector<int> cur;
// cur.push_back(1);
// while (cur.size() <= n/2 + 1 && isSubsequence(cur) == 1) {
// ones ++;
// cur.push_back(1);
// }
// cur.assign(1, 0);
// while (cur.size() <= n/2 + 1 && isSubsequence(cur) == 1) {
// zero ++;
// cur.push_back(0);
// }
// if (ones < n/2 + 1) zero = n - ones;
// else if (zero < n/2 + 1) ones = n - zero;
for (int i = 0; i < (1 << n); i++) {
ans.assign(n, 0);
for (int j = n-1; j >= 0; j--) {
if ((i & (1 << j)) > 0) ans[n-j-1] = 1;
}
if (isSubsequence(ans) == 1) return ans;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |