# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
582032 | 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.
//#include "library.h"
#include <bits/stdc++.h>
using namespace std;
void Solve(int n)
{
vector < int > ans , v(n,0) , cur(n,0) ;
ans.push_back(0) ;
int aim = 0 ;
for ( int i = 0 ; i < n ; i++ )
{
int sum = 0 ;
for ( int j = 0 ; j < n ; j++ )
{
cur = v ;
cur[i] = cur[j] = 1 ;
if ( Query(cur) == 1 ) sum++ ;
}
if ( sum == 1 ) { aim = i+1 ; break ; }
}
ans.push_back(aim) ;
for ( int j = 1 ; j < n ; j++ )
{
v[ans[ans.size()-1]-1] = 1 ;
for ( int i = 0 ; i < n ; i++ )
{
cur = v ;
cur[i] = 1 ;
if ( Query(cur) == 1 )
{
ans.push_back(i+1) ;
break ;
}
}
}
Answer(ans) ;
}
// Query(x) , x : where x is a vector with 0 or 1
// Answer(x) . x : where x is a vector with number from 1 -> n