# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
472093 | nickmet2004 | Hidden Sequence (info1cup18_hidden) | C++11 | 0 ms | 0 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;
bool aks(int x , int y , int c){
vector<int > v;
while(x--)v.push_back(c);
while(y--)v.push_back(c^1);
return isSubsequence(v);
}
int n0 , n1;
vector<int>findSequence(int n){
for(int i = 1; i <= n; ++i){
if(!ask(i , 0 , 0)){
n0 = i - 1;
n1 = n - n0;
break;
}
if(!ask(i , 0 , 1)){
n1 = i -1;
n0 = n - n1;
break;
}
}
vector<int> ans;
int a0 = 0 , a1 = 0 , b0 = n0 , b1 =n1 , q = 0;
for(int i= 1; i<= n; ++i){
if(a0 + b1 <= n/2){
if(ask(a0 + 1 , b1 , 0)){
q = 0;
}else q = 1;
}else{
if(ask(a1 + 1, b0 , 1)){
q=1;
}else q= 0;
}
if(q){
a1++; b1--;
}
else a0++ , b0--;
ans.push_back(q);
}
}