# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1141885 | JelalTkm | Hidden Sequence (info1cup18_hidden) | C++20 | 1 ms | 556 KiB |
#include <bits/stdc++.h>
#include "grader.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace std;
// #define int long long int
// const int N = 1e3 + 100;
// const int md = 1e9 + 7;
// const int INF = 1e18;
vector<int> dfs(int cnt, int n, vector<int> v) {
if (cnt == n + 1)
return v;
v.push_back(0);
if (isSubsequence(v)) {
vector<int> ans = dfs(cnt + 1, n, v);
if (!ans.empty())
return ans;
}
v.pop_back();
v.push_back(1);
return dfs(cnt + 1, n, v);
}
vector<int> findSequence(int n) {
return dfs(1, n, {});
}
// int32_t main(int32_t argc, char *argv[]) {
// ios::sync_with_stdio(false);
// cin.tie(nullptr);
// int T = 1;
// // cin >> T;
// while (T--) {
// }
// return 0;
// }
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |