# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1141872 | stdfloat | Hidden Sequence (info1cup18_hidden) | C++20 | 2 ms | 444 KiB |
#include<bits/stdc++.h>
#include "grader.h"
// #include "grader.cpp"
using namespace std;
vector<int> findSequence (int n) {
vector<int> ans = {0};
while (isSubsequence(ans)) ans.push_back(0);
ans.pop_back();
int x = 0;
while (x < n) {
ans.insert(ans.begin() + x, 1);
while (isSubsequence(ans)) {
x++;
ans.insert(ans.begin() + x, 1);
}
ans.erase(ans.begin() + x);
x++;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |