# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1141870 | JelalTkm | Hidden Sequence (info1cup18_hidden) | C++20 | 1022 ms | 436 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> findSequence(int n) {
priority_queue<pair<int, vector<int>>> q;
vector<int> a;
q.push({0, a});
while (!q.empty()) {
auto [u, v] = q.top();
if (u == n)
return v;
q.pop();
vector<int> v1 = v;
v1.push_back(1);
if (isSubsequence(v1)) {
q.push({u + 1, v1});
}
v1.pop_back();
v1.push_back(0);
if (isSubsequence(v1)) {
q.push({u + 1, v1});
}
}
return {};
}
// 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... |