# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1174462 | Pacybwoah | Hidden Sequence (info1cup18_hidden) | C++20 | 2 ms | 428 KiB |
#include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include "grader.h"
using namespace std;
vector<int> findSequence(int N){
int n = N;
vector<int> que;
int a, b;
for(int i = 0; i < (n + 1) / 2; i++){
que.push_back(0);
}
if(isSubsequence(que)) a = 0, b = 1;
else a = 1, b = 0;
vector<int>().swap(que);
int sz = 0;
for(int i = 0; i < n; i++){
que.push_back(b);
if(!isSubsequence(que)){
sz = i;
break;
}
}
if(sz == 0) return vector<int>(n, a);
vector<int> ans(sz + 1, -1), poss;
for(int i = 0; i <= sz; i++) poss.push_back(i);
int now = 1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |