# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
408741 | Atill83 | Hidden Sequence (info1cup18_hidden) | C++14 | 146 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<bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int> findSequence(int n){
vector<int> sorg((n + 1) / 2, 0);
int less = 0;
if(isSubsequence(sorg)){
less = 1;
}
int idx = 0;
while(idx <= (n + 1) / 2 && isSubsequence(vector<int>(idx, less)))
idx++;
idx--;
vector<int> say(2, 0);
say[less] = idx;
say[!less] = n - idx;
vector<int> onc(idx + 1, 0);
for(int i = 1; i <= say[less]; i++){
vector<int> srg;
for(int j = 0; j < i; j++)
srg.push_back(less);
bool done = 0;
int mx = 0;
for(int j = 1; (j + i) <= n / 2 + 1; j++){
srg.push_back(!less);
if(!isSubsequence(srg)){
done = 1;
mx = j - 1;
break;
}
}
if(done){
onc[i] = say[!less] - mx;
}else{
mx = 0;
for(int j = 0; (j + say[less] - i + 1) <= n / 2 + 1; j++){
mx = j;
srg.clear();
for(int l = 0; l < j; l++)
srg.push_back(!less);
for(int l = 0; l < say[less] - i + 1; l++)
srg.push_back(less);
if(!isSubsequence(srg)){
done = 1;
mx = j - 1;
break;
}
}
onc[i] = mx;
}
}
vector<int> ans;
int ot = 0;
for(int i = 1; i <= idx; i++){
while(ot < onc[i]){
ans.push_back(!less);
ot++;
}
ans.push_back(less);
}
while(ot < say[!less]){
ot++;
ans.push_back(!less);
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |