| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 994859 | lollipop | Library (JOI18_library) | 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 "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 ;
// int Query( vector )
// void Answer ( vector )
void solve( int n ){
vector < int > ans , lf ;
for( int i = 2 ; i <= n ; i ++ ) lf.pb( i ) ;
ans.pb( 1 ) ;
vector < int > cur ;
while( true ){
if( ans.size() == n ) break ;
int l = 0 , r = lf.size() - 1 ;
while( l < r ){
int mid = ( l + r ) / 2 ;
cur.clear() ;
// will left be good?
for( int j = 0 ; j <= mid ; j ++ ) cur.pb( lf[ j ] ) ;
int nmb ;
nmb = Query( cur ) ;
for( auto x : ans ) cur.pb( x ) ;
int nmb1 ;
nmb1 = Query( cur ) ;
if( nmb1 == nmb ){
r = mid ; continue ;
}
else{
l = mid + 1 ; continue ;
}
}
// gipovia mezobeli -- l -- shia
int node = lf[ l ] ;
lf.erase( lf.begin() + l ) ;
int nmb ;
nmb = Query( { node , ans[ 0 ] } ) ;
if( nmb == 2 ){
ans.pb( node ) ;
}
else ans.insert( ans.begin() , node ) ;
}
Answer( ans ) ;
}
//signed main() {
// ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
// int t = 1 ; // cin >> t ;
// while( t -- ){
// solve() ;
// }
//
//}