# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
333057 | 3zp | Hidden Sequence (info1cup18_hidden) | C++14 | 9 ms | 492 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 ask(int a, int b, int c){
vector<int> v;
while(a--) v.push_back(c);
while(b--) 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;
}
}
int a0=0, a1=0, b0=n0, b1=n1;
vector<int> ans;
for(int i = 1; i <= N; i++){
int x;
if(a0+b1+1 <= N/2+1){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |