# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1207846 | lopkus | Hidden Sequence (info1cup18_hidden) | C++20 | 1022 ms | 420 KiB |
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;
vector < int > findSequence (int N) {
std::vector<int> ans;
while(ans.size() != N) {
int ok = 0;
for(int t = 0; t < 2&& !ok; t++) {
for(int s = 0; s < 2 && !ok; s++) {
if(t == 0) {
std::vector<int> b;
b.push_back(s);
for(int i = 0; i < ans.size(); i++) {
b.push_back(ans[i]);
}
if(isSubsequence(b)) {
ok = 1;
ans = b;
break;
}
}
else {
std::vector<int> b = ans;
b.push_back(s);
if(isSubsequence(b)) {
ok = 1;
ans = b;
break;
}
}
}
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |