# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95348 | dalgerok | Hidden Sequence (info1cup18_hidden) | C++14 | 6 ms | 296 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 "grader.h"
#include<bits/stdc++.h>
using namespace std;
vector < int > findSequence(int N){
vector < int > ans(N, 0), v0, v1;
int kol0 = 0, kol1 = 0, cnt0 = 0, cnt1 = 1;
for(int i = 0; i < N; i++){
v0.push_back(0);
v1.push_back(1);
if(isSubsequence(v0) == false){
kol0 = i;
kol1 = N - kol0;
break;
}
if(isSubsequence(v1) == false){
kol1 = i;
kol0 = N - kol1;
break;
}
}
for(int i = 0; i < N; i++){
vector < int > vec;
if(cnt0 + 1 + kol1 - cnt1 <= N / 2 + 1){
for(int j = 1; j <= cnt0 + 1; j++){
vec.push_back(0);
}
for(int j = 1; j <= kol1 - cnt1; j++){
vec.push_back(1);
}
if(isSubsequence(vec) == true){
cnt0 += 1;
ans[i] = 0;
}
else{
cnt1 += 1;
ans[i] = 1;
}
}
else{
for(int j = 1; j <= cnt1 + 1; j++){
vec.push_back(1);
}
for(int j = 1; j <= kol0 - cnt0; j++){
vec.push_back(0);
}
if(isSubsequence(vec) == true){
cnt1 += 1;
ans[i] = 1;
}
else{
cnt0 += 1;
ans[i] = 0;
}
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |