| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1357943 | altern23 | Hidden Sequence (info1cup18_hidden) | C++20 | 144 ms | 432 KiB |
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
#define ll long long
vector <int> findSequence (int N) {
vector <int> ans;
while (ans.size() < N) {
for (int j = 0; j <= (ll)ans.size(); j++) {
vector <int> tmp;
for (int k = 1; k <= j; k++) tmp.push_back(ans[k-1]);
tmp.push_back(0);
for (int k = j+1; k <= (ll)ans.size(); k++) tmp.push_back(ans[k-1]);
if (isSubsequence(tmp)) {
ans.swap(tmp);
break;
}
tmp.clear();
for (int k = 1; k <= j; k++) tmp.push_back(ans[k-1]);
tmp.push_back(1);
for (int k = j+1; k <= (ll)ans.size(); k++) tmp.push_back(ans[k-1]);
if (isSubsequence(tmp)) {
ans.swap(tmp);
break;
}
}
}
return ans;
}
Compilation message (stderr)
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
