# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47198 | Kmcode | Hidden Sequence (info1cup18_hidden) | C++14 | 25 ms | 580 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
#include "grader.h"
using namespace std;
vector<int> findSequence(int N) {
vector<int> vv;
int ls = 0;
while (N--) {
while (1) {
vv.insert(vv.begin() + vv.size() - ls, 0);
if (isSubsequence(vv)) {
break;
}
vv[vv.size() - ls - 1] ^= true;
if (isSubsequence(vv)) {
break;
}
vv.erase(vv.begin() + vv.size() - (ls+1), vv.begin() + vv.size() - (ls+1) + 1);
ls++;
}
}
return vv;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |