# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1134813 | lopkus | Hidden Sequence (info1cup18_hidden) | C++20 | 198 ms | 468 KiB |
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int> findSequence(int N){
vector<int> ans;
while(ans.size() != N) {
for(int i = 0; i <= ans.size(); i++) {
vector<int> B = ans;
B.insert(B.begin() + i, 0);
if(isSubsequence(B)) {
ans = B;
break;
}
B = ans;
B.insert(B.begin() + i, 1);
if(isSubsequence(B)) {
ans = B;
break;
}
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |