# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
582151 | YaserFaisal | Library (JOI18_library) | C++14 | 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.
void Solve(int n)
{
vector < int > ans , v(n,0) , cur ;
for ( int i = 0 ; i < n ; i++ )
{
int sum = 0 ;
for ( int j = 0 ; j < n ; j++ )
{
if ( i == j ) continue;
cur = v ;
cur[i] = cur[j] = 1 ;
if ( Query(cur) == 1 ) sum++ ;
}
if ( sum == 1 ) { ans.push_back(i) ; break ; }
}
for ( int j = 1 ; j < n ; j++ )
{
v[ans[ans.size()-1]] = 1 ;
for ( int i = 0 ; i < n ; i++ )
{
if ( v[i] == 1 ) continue;
cur = v ;
cur[i] = 1 ;
if ( Query(cur) == 1 )
{
ans.push_back(i) ;
break ;
}
}
}
for ( int i = 0 ; i < n ; i++ ) ans[i]++ ;
Answer(ans) ;
}