# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
518713 | 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>
using namespace std;
vector <int> vans;
vector <int> s;
bool ask( int nr0, int nr1, int f ) {
s.clear();
if ( nr0 + nr1 == 0 )
return 1;
if ( f == 0 ) {
while ( nr0-- )
s.push_back( 0 );
while ( nr1-- )
s.push_back( 1 );
} else {
while ( nr1-- )
s.push_back( 1 );
while ( nr0-- )
s.push_back( 0 );
}
return isSubsequence( s );
}
void add( int b, int x ) {
while ( x-- )
vans.push_back( b );
}
vector <int> findSequence( int n ) {
int nr0, nr1, b, zero, ram0, i;
nr0 = 0;
while ( nr0 <= n / 2 + 1 && ask( nr0, 0, 0 ) )
nr0++;
if ( nr0 == n / 2 + 2 ) {
while ( !ask( 0, n - nr0, 0 ) )
nr0++;
nr1 = nr0;
nr0 = n - nr0;
b = 1;
} else {
nr0--;
nr1 = n - nr0;
b = 0;
}
ram0 = nr0;
for ( i = 1; i <= nr1; i++ ) {
zero = 0;
while ( zero <= nr0 && ask( zero, i, !b ) )
zero++;
zero--;
add( b, ram0 - zero );
ram0 = zero;
add( !b, 1 );
}
add( b, ram0 );
return vans;
}