# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
967456 | LucaIlie | Hidden Sequence (info1cup18_hidden) | C++17 | 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 <iostream>
#include <vector>
#include "grader.h"
using namespace std;
vector <int> vans;
vector <int> seq;
bool ask( int nr0, int nr1, int s ) {
int i;
seq.clear();
if ( nr0 + nr1 == 0 )
return 1;
for ( i = 0; i < nr1; i++ )
seq.push_back( 1^s );
for ( i = 0; i < nr0; i++ )
seq.push_back( 0^s );
return isSubsequence( seq );
}
void add( int b, int x ) {
int i;
for ( i = 0; i < x; i++ )
vans.push_back( b );
}
vector <int> findSequence( int n ) {
int nr0, nr1, s, zero, ram0, i;
int l = 1, r = n + 1;
while ( r - l > 1 ) {
int mid = (l + r) / 2;
if ( ask( mid, 0, 0 ) )
l = mid;
else
r = mid;
}
int nr0 = 0;
if ( nr0 > n / 2 ) {
nr1 = nr0;
nr0 = n - nr0;
s = 1;
} else {
nr1 = n - nr0;
s = 0;
}
ram0 = nr0;
for ( i = 1; i <= nr1; i++ ) {
zero = 0;
while ( zero <= ram0 && ask( zero, i, s ) )
zero++;
zero--;
add( s, ram0 - zero );
ram0 = zero;
add( !s, 1 );
}
add( s, ram0 );
return vans;
}