제출 #220347

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
220347		infinite_iq	로봇 (IOI13_robots)	C++14	100 / 100	1765 ms	22892 KiB

robots

    #define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
    #include <bits/stdc++.h>
    using namespace std;
    #define sqr 400
    #define mid (l+r)/2
    #define pb push_back
    #define ppb pop_back
    #define fi first
    #define se second
    #define lb lower_bound
    #define ub upper_bound
    #define ins insert
    #define era erase
    #define C continue
    #define mem(dp,i) memset(dp,i,sizeof(dp))
    #define mset multiset
    typedef long long ll;
    typedef short int si;
    typedef long double ld;
    typedef pair<int,int> pi;
    typedef pair<ll,ll> pll;
    typedef vector<int> vi;
    typedef vector<ll> vll;
    typedef vector<pi> vpi;
    typedef vector<pll> vpll;
    const ll mod=1e9+7;
    const ll inf= 4e18;
    const ld pai=acos(-1);
    #include "robots.h"
    int szw,szl,n;
    priority_queue<int> pq;
    int wl[100009],sl[100009];
    pi r[1000009];
    int check ( int x ) {
            int j = 0 ;
            while ( pq .size() ){
                    pq.pop () ;
            }
            for ( int i = 0 ;i < szw ;i ++ ) {
                    while ( j < n && r[j].fi<wl[i] ) {
                            pq.push ( r[j].se ) ;
                            j ++ ;
                    }
                    for ( int num = 0 ; num < x ; num ++ ){
                            if ( ! pq.size() ) break ;
                            pq .pop ();
                    }
            }
            for ( int i = j ; i < n ; i ++ ) {
                    pq.push( r[i].se ) ;
            }
            for ( int i = szl-1 ; i >= 0 ;i -- ){
                    for ( int num = 0 ; num < x ; num ++ ){
                            if ( pq.size() && pq.top () < sl[i] ) pq.pop() ;
                            else break ;
                    }
            }
            return pq.empty() ;
    }
    int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
            szw=A , szl = B , n = T ;
            for ( int i =0 ;i < n ;i ++ ) {
                    r[i]= { W[i] , S[i] } ;
            }
            for ( int i =0 ;i < szw ;i ++ ){
                    wl[i] = X[i];
            }
            for ( int i =0 ;i < szl ;i ++ ){
                    sl[i] = Y[i];
            }
            sort ( wl , wl+szw ) , sort ( sl , sl+szl ) , sort ( r , r+n ) ;
      		for (int i=0; i<T; i++) {
        		if ((!szw || r[i].first >= wl[szw-1]) && (!szl || r[i].second >= sl[szl-1])) {
       		     	return -1;
    		    }
 		   }
            int l = 0 , r = n  ;
            while ( r - l > 1 ) {
                    if ( check ( mid ) ) r = mid;
                    else l = mid;
            }
            return r ;
    }

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 25 / 25
• Subtask 4: 37 / 37
• Subtask 5: 10 / 10