# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1141544 | Agageldi | Hidden Sequence (info1cup18_hidden) | C++20 | 1012 ms | 416 KiB |
#include<bits/stdc++.h>
// #include "grader.cpp"
#include "grader.h"
using namespace std;
vector <int> v;
int n, m, a[500];
void solve(int x,int N) {
if((int)v.size()) return;
if(x == N+1) {
vector <int> ans;
for(int i=1;i<=N;i++) {
ans.push_back(a[i]);
}
bool answer = isSubsequence(ans);
if(answer) v = ans;
return;
}
for(int i = 0;i<= 1;i++) {
a[x] = i;
solve(x + 1, N);
}
}
vector < int > findSequence (int N)
{
solve(1,N);
return v;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |