제출 #290079

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
290079		egekabas	로봇 (IOI13_robots)	C++14	90 / 100	3072 ms	20144 KiB

robots

#include "robots.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int a, b, t;
vector<pii> v;
set<pii> x, y;
int cntx[50009], cnty[50009];
int check(int val){
    for(auto u : v){
        auto i1 = y.lower_bound(mp(u.ss, 1e9));
        if(i1 != y.end()){
            ++cnty[i1->ss];
            if(cnty[i1->ss] >= val)
                y.erase(i1);
            continue;
        }
        auto i2 = x.lower_bound(mp(u.ff, 1e9));
        if(i2 == x.end())
            return 0;
        ++cntx[i2->ss];
        if(cntx[i2->ss] >= val)
            x.erase(i2);
        continue;
    }
    return 1;
}
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    a = A;
    b = B;
    t = T;
    for(int i = 0; i < t; ++i){
        v.pb({W[i], S[i]});
    }
    sort(all(v), greater<pii>());
    int l = 1, r = t+1;
    while(l < r){
        x.clear();
        y.clear();
        for(int i = 0; i < a; ++i){
            cntx[i] = 0;
            x.insert({X[i], i});
        }
        for(int i = 0; i < b; ++i){
            cnty[i] = 0;
            y.insert({Y[i], i});
        }
        int m = (l+r)/2;
        int st = check(m);
        if(st){
            r = m;
        }
        else
            l = m+1;
    }
    if(l == t+1){
        return -1;
    }
    return l;
}

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