제출 #355437

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
355437		rrrr10000	로봇 (IOI13_robots)	C++14	100 / 100	1968 ms	33152 KiB

robots

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
#define dame(a) {cout<<a<<endl;return 0;}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vvvp=vector<vvp>;
using vb=vector<bool>;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
#include"robots.h"
int putaway(int A,int B,int n,int X[],int Y[],int W[],int S[]){
    vi x(A),y(B);rep(i,A)x[i]=X[i];rep(i,B)y[i]=Y[i];sort(all(x));rsort(y);
    vp v(n);
    rep(i,n)v[i]=P(W[i],S[i]);
    sort(all(v));
    ll ok=n+1,ng=0;
    while(ok-ng>1){
        ll md=(ok+ng)/2;
        ll w=0;
        priority_queue<ll> pq;
        rep(i,A){
            while(w<n&&v[w].fi<x[i])pq.push(v[w++].se);
            rep(j,md){
                if(pq.empty())break;
                pq.pop();
            }
        }
        while(w<n)pq.push(v[w++].se);
        rep(i,B){
            rep(j,md){
                if(pq.empty()||pq.top()>=y[i])break;
                pq.pop();
            }
        }
        if(pq.empty())ok=md;
        else ng=md;
    }
    if(ok==n+1)return -1;
    return ok;
}/*
int main(){
    int n,a,b;cin>>a>>b>>n;
    int x[10],y[10],w[10],s[10];
    rep(i,a)cin>>x[i];
    rep(i,b)cin>>y[i];
    rep(i,n)cin>>w[i]>>s[i];
    out(putaway(a,b,n,x,y,w,s));
}*/

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