# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
472079 | nickmet2004 | Hidden Sequence (info1cup18_hidden) | C++11 | 5 ms | 456 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;
int N , Q;
bool ask(int x , int y , int c){
vector<int> v;
while(x--)v.emplace_back(c);
while(y--)v.emplace_back(c^1);
int w = 0;
if(N){
w = N - x;
while(w--)v.emplace_back(c);
}
return isSubsequence(v);
}
vector<int> findSequence(int n){
vector<int> ans;
ans.resize(n);
int n0 = 0 , n1 = 0;
for(int i =1; i <= n; ++i){
if(!ask(i , 0, 0)){
n0 = i - 1;
n1 = n - n0;
break;
}
}
N = n0;
if(n0<n1) N = n1 , Q^=1;
int a= 0 , b = 0;
for(int i = 1; i <= n; ++i){
if(!ask(a , b + 1 , Q)){
b =0;
a++;
ans.push_back(Q);
}else{
b++;
ans.push_back(Q^1);
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |