oj.uz

답안 #774414

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
774414 2023-07-05T17:34:28 Z lollipop 최후의 만찬 (IOI12_supper) C++17
0 / 100
 117 ms 15204 KB 
#include "advisor.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;
#define ordered_set tree<int, null_type,less<int>, 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 ;
vector < int > v[ N ] ;
int xx[ 30 ] , cur[ N ] , app[ N ] ;
void ComputeAdvice(int *c, int n, int r, int m){
	 for( int j = n - 1 ; j >= 0 ; j -- ){
	 	v[ c[ j ] ].pb( j ) ;
	 }
	 set < pair < int , int > > se ; 
	 FOR( i , r ){
	 	int pos = INT_MAX ; 
		if( v[ i ].size() != 0 ) pos = v[ i ][ v[ i ].size() - 1 ] ;
		pair < int , int > p ; 
		p.f = pos ; p.s = i ; 
		se.insert( p ) ;
	 }
	 vector < int > ve ; 
	 FOR( i , r ) ve.pb( 0 ) , app[ i ] = i , cur[ i ] = 1 ;  
	 FOR( i , n ){
	 	int x = c[ i ] ; 
	 	if( cur[ x ] == 1 ){
	 		ve[ app[ x ] ] = 1 ; 
	 		se.erase( se.find( { v[ x ][ v[ x ].size() - 1 ] , x } ) ) ;
	 		v[ x ].pop_back() ;
	 		if( v[ x ].size() != 0 ) se.insert( { v[ x ][ v[ x ].size() - 1 ] , x } ) ;
	 		else se.insert( { INT_MAX , x } ) ;
	 		ve.pb( 0 ) ;
	 		app[ x ] = ve.size() - 1 ; 
	 		continue ; 
		}
		pair < int , int > p ;
		p = *(--se.end() ) ;
		se.erase( --se.end() ) ; 
		v[ x ].pop_back() ;
		ve.pb( 0 ) ; 
		app[ x ] = ve.size() - 1 ; 
 	 	int pos = INT_MAX ; 
		if( v[ x ].size() != 0 ) pos = v[ x ][ v[ x ].size() - 1 ] ;
		pair < int , int > p1 ; 
		p1.f = pos ; p1.s = x ; 
		se.insert( p1 ) ;
		cur[ x ] = 1 ;
		cur[ p.s ] = -1 ; 		 
	 } 
	 for( auto x : ve ) WriteAdvice( x ) ; 
}

//void WriteAdvice(unsigned char a);



//#include "grader.h"
#include "assistant.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;
#define ordered_set tree<int, null_type,less<int>, 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 pos[ N ] ;
void Assist(unsigned char *a, int n, int r, int rr){
     set < int > act , non ;
     int cnt = 0 ; 
     FOR( i , r ){
     	if( a[ i ] == 1 ) act.insert( i ) ;
		else non.insert( i ) ; 
	    pos[ i ] = i ;  
	    cnt ++ ; 
	 }
	 FOR( i , N ){
	 	int x = GetRequest() ;
	 	if( act.find( x ) != act.end() ){
	 	    pos[ x ] = cnt ;
			if( a[ cnt ] == 0 ){
				act.erase( act.find( x ) ) ;
				non.insert( x ) ;
			} 	
			cnt ++ ; 
			continue ; 
		}
		int X = *non.begin() ;
		non.erase( non.begin() ) ; 
		PutBack( X ) ;
		pos[ x ] = cnt ; cnt ++ ; 
		if( a[ pos[ x ] ] == 1 ) act.insert( x ) ;
		else non.insert( x ) ; 
	 }
    
}

//void PutBack(int T);
//
//int GetRequest();

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 5268 KB Error - Too many requests
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 6288 KB Error - Too many requests
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 80 ms 12512 KB Error - Too many requests
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 5688 KB Error - Too many requests
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 110 ms 13748 KB Error - Too many requests
2 Incorrect 108 ms 14012 KB Error - Too many requests
3 Incorrect 117 ms 14188 KB Error - Too many requests
4 Incorrect 103 ms 14188 KB Error - Too many requests
5 Incorrect 104 ms 14184 KB Error - Too many requests
6 Incorrect 115 ms 14336 KB Error - Too many requests
7 Incorrect 103 ms 14104 KB Error - Too many requests
8 Incorrect 108 ms 14124 KB Error - Too many requests
9 Incorrect 103 ms 14140 KB Error - Too many requests
10 Incorrect 88 ms 15204 KB Error - Too many requests