#include "library.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
//#define int long long
#define pb push_back
#define s second
#define f first
#define pf push_front
#define inf 100000000000000000
#define bitebi __builtin_popcountll
#define FOR( i , n ) for( int i = 0 ; i < n ; i ++ )
#define YES cout <<"YES\n"
#define NO cout << "NO\n"
#define debug cout << "Here Fine" << endl ;
#define pr pair < int , int >
#define fbo find_by_order // returns iterator
#define ook order_of_key // returns strictly less numbers than key
using namespace std ;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template<class T> using ordered_set =tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update> ;
const double Pi=acos(-1.0);
const double EPS=1E-8;
const int mod = 1000000007 ;
const int mod1 = 998244353 ;
const int N = 2e5 + 10 ;
mt19937 R(time(0));
map < int , int > ma , ma1 ;
//namespace {
//struct Judge
//{
// int N;
// int A[1002];
// int pos[1002];
// bool f[1002];
// int query_c;
// bool answered;
// void init()
// {
// query_c=0;
// int ret=scanf("%d",&N); ret++;
// answered=false;
// for(int i=0;i<N;i++)ret=scanf("%d",&A[i]),pos[A[i]]=i;
// }
// int query(const vector<int>& M)
// {
// if(query_c==20000)
// {
// puts("Wrong Answer [3]");
// exit(0);
// }
// if(int(M.size())!=N)
// {
// puts("Wrong Answer [1]");
// exit(0);
// }
// bool all_zero=true;
// for(int i=0;i<N;i++)
// {
// if(M[i]!=0&&M[i]!=1)
// {
// puts("Wrong Answer [2]");
// exit(0);
// }
// if(M[i]==1)all_zero=false;
// }
// if(all_zero)
// {
// puts("Wrong Answer [2]");
// exit(0);
// }
// memset(f,0,sizeof(f));
// for(int i=0;i<N;i++)if(M[i])f[pos[i+1]]=true;
// bool las=false;
// int r=0;
// for(int i=0;i<N;i++)
// {
// if(las==false&&f[i]==true)r++;
// las=f[i];
// }
// query_c++;
// return r;
// }
// void answer(const vector<int>& res)
// {
// bool f1=true,f2=true;
// if(int(res.size())!=N)
// {
// puts("Wrong Answer [4]");
// exit(0);
// }
// if(answered)
// {
// puts("Wrong Answer [7]");
// exit(0);
// }
// answered=true;
// memset(f,0,sizeof(f));
// for(int i=0;i<N;i++)
// {
// if(res[i]<=0||res[i]>N)
// {
// puts("Wrong Answer [5]");
// exit(0);
// }
// if(f[res[i]])
// {
// puts("Wrong Answer [6]");
// exit(0);
// }
// f[res[i]]=true;
// }
// for(int i=0;i<N;i++)
// {
// f1&=A[i]==res[i];
// f2&=A[i]==res[N-i-1];
// }
// if(!f1&&!f2)
// {
// puts("Wrong Answer [8]");
// exit(0);
// }
// }
// void end()
// {
// if(!answered)puts("Wrong Answer [7]");
// else printf("Accepted : %d\n",query_c);
// }
//}judge;
//}
//
//int Query(const vector<int>& M)
//{
// return judge.query(M);
//}
//void Answer(const vector<int>& res)
//{
// judge.answer(res);
//}
// int Query( vector )
// void Answer ( vector )
vector < int > ans , lf , cur ;
void Solve( int n ){
for( int i = 2 ; i <= n ; i ++ ) lf.pb( i ) ;
ans.pb( 1 ) ;
FOR( i , n ) cur.pb( 0 ) ;
while( true ){
int ss = ans.size() ;
if( ss == n ) break ;
int l = 0 , r = lf.size() - 1 ;
while( l < r ){
// cout << l << " " << r << endl ;
int mid = ( l + r - 1 ) / 2 ;
FOR( i , n ) cur[ i ] = 0 ;
for( int j = l ; j <= mid ; j ++ ) cur[ lf[ j ] - 1 ] = 1 ;
int nmb ;
nmb = Query( cur ) ;
// cout << nmb << endl ;
for( auto x : ans ) cur[ x - 1 ] = 1 ;
int nmb1 ;
nmb1 = Query( cur ) ;
// cout << nmb1 << endl ;
if( nmb1 <= nmb ){
r = mid ; continue ;
}
else{
l = mid + 1 ; continue ;
}
}
// gipovia mezobeli -- l -- shia
int node = lf[ l ] ;
// cout << node << endl ;
lf.erase( lf.begin() + l ) ;
int nmb ;
FOR( i , n ) cur[ i ] = 0 ;
cur[ node - 1 ] = 1 ;
cur[ ans[ 0 ] - 1 ] = 1 ;
nmb = Query( cur ) ;
if( nmb == 2 ){
ans.pb( node ) ;
}
else{
ans.pb( node ) ;
for( int i = ans.size() - 2 ; i >= 0 ; i -- )
swap( ans[ i ] , ans[ i + 1 ] ) ;
}
}
Answer( ans ) ;
}
//int main()
//{
// judge.init();
// Solve(judge.N);
// judge.end();
//}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
28 ms |
344 KB |
# of queries: 2575 |
| 2 |
Correct |
25 ms |
344 KB |
# of queries: 2566 |
| 3 |
Correct |
27 ms |
344 KB |
# of queries: 2703 |
| 4 |
Correct |
28 ms |
344 KB |
# of queries: 2693 |
| 5 |
Correct |
15 ms |
344 KB |
# of queries: 2693 |
| 6 |
Correct |
16 ms |
344 KB |
# of queries: 2715 |
| 7 |
Correct |
28 ms |
344 KB |
# of queries: 2713 |
| 8 |
Correct |
23 ms |
344 KB |
# of queries: 2600 |
| 9 |
Correct |
33 ms |
344 KB |
# of queries: 2670 |
| 10 |
Correct |
19 ms |
344 KB |
# of queries: 1562 |
| 11 |
Correct |
0 ms |
344 KB |
# of queries: 0 |
| 12 |
Correct |
0 ms |
344 KB |
# of queries: 1 |
| 13 |
Correct |
0 ms |
344 KB |
# of queries: 4 |
| 14 |
Correct |
0 ms |
344 KB |
# of queries: 9 |
| 15 |
Correct |
1 ms |
344 KB |
# of queries: 90 |
| 16 |
Correct |
2 ms |
344 KB |
# of queries: 212 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
28 ms |
344 KB |
# of queries: 2575 |
| 2 |
Correct |
25 ms |
344 KB |
# of queries: 2566 |
| 3 |
Correct |
27 ms |
344 KB |
# of queries: 2703 |
| 4 |
Correct |
28 ms |
344 KB |
# of queries: 2693 |
| 5 |
Correct |
15 ms |
344 KB |
# of queries: 2693 |
| 6 |
Correct |
16 ms |
344 KB |
# of queries: 2715 |
| 7 |
Correct |
28 ms |
344 KB |
# of queries: 2713 |
| 8 |
Correct |
23 ms |
344 KB |
# of queries: 2600 |
| 9 |
Correct |
33 ms |
344 KB |
# of queries: 2670 |
| 10 |
Correct |
19 ms |
344 KB |
# of queries: 1562 |
| 11 |
Correct |
0 ms |
344 KB |
# of queries: 0 |
| 12 |
Correct |
0 ms |
344 KB |
# of queries: 1 |
| 13 |
Correct |
0 ms |
344 KB |
# of queries: 4 |
| 14 |
Correct |
0 ms |
344 KB |
# of queries: 9 |
| 15 |
Correct |
1 ms |
344 KB |
# of queries: 90 |
| 16 |
Correct |
2 ms |
344 KB |
# of queries: 212 |
| 17 |
Correct |
217 ms |
432 KB |
# of queries: 18145 |
| 18 |
Correct |
204 ms |
436 KB |
# of queries: 17952 |
| 19 |
Correct |
196 ms |
428 KB |
# of queries: 18125 |
| 20 |
Correct |
194 ms |
592 KB |
# of queries: 16971 |
| 21 |
Correct |
179 ms |
432 KB |
# of queries: 15864 |
| 22 |
Correct |
204 ms |
344 KB |
# of queries: 18191 |
| 23 |
Correct |
200 ms |
596 KB |
# of queries: 18136 |
| 24 |
Correct |
83 ms |
432 KB |
# of queries: 8360 |
| 25 |
Correct |
207 ms |
428 KB |
# of queries: 17698 |
| 26 |
Correct |
184 ms |
444 KB |
# of queries: 16506 |
| 27 |
Correct |
88 ms |
344 KB |
# of queries: 8276 |
| 28 |
Correct |
184 ms |
344 KB |
# of queries: 16955 |
| 29 |
Correct |
207 ms |
436 KB |
# of queries: 16936 |
| 30 |
Correct |
182 ms |
424 KB |
# of queries: 16955 |
