Submission #56055

#	Time	Username	Problem	Language	Result	Execution time	Memory
56055		win11905	Robots (IOI13_robots)	C++11	39 / 100	3063 ms	8960 KiB

robots

#include "robots.h"
#include <bits/stdc++.h>
#define pii pair<int, int>
#define x first
#define y second
using namespace std;

const int INF = 1e6+1;
const int INF2 = 2e9+1;

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    sort(X, X + A), sort(Y, Y + B);
    int l = 1, r = 1e6+1;
    while(l < r) {
        int m = l + r >> 1;
        vector<pii> V;
        for(int i = 0; i < T; ++i) V.emplace_back(W[i], S[i]);
        sort(V.begin(), V.end());
        for(int i = 0; i < A; ++i) {
            int z = m;
            while(z) {
                bool st = true;
                for(int j = V.size() - 1; ~j; --j) {
                    if(V[j].x < X[i]) {
                        V.erase(V.begin() + j);
                        st = false;
                        z--;
                        break;
                    }
                }
                if(st) break;
            }
        }
        sort(V.begin(), V.end(), [&](const pii &a, const pii &b) { return a.y < b.y; });
        for(int i = 0; i < B; ++i) {
            int z = m;
            while(z) {
                bool st = true;
                for(int j = V.size() - 1; ~j; --j) {
                    if(V[j].y < Y[i]) {
                        V.erase(V.begin() + j);
                        st = false;
                        z--;
                        break;
                    }
                }
                if(st) break;
            }
        } 
        if(V.empty()) r = m;
        else l = m+1;
    }
    int mn = r;
    l = 1, r = INF;
    while(l < r) {
        int m = l + r >> 1;
        vector<pii> V;
        for(int i = 0; i < T; ++i) V.emplace_back(W[i], S[i]);
        sort(V.begin(), V.end(), [&](const pii &a, const pii &b) {
            if(a.y == b.y) return a.x < b.x;
            return a.y < b.y;
        });
        for(int i = 0; i < B; ++i) {
            int z = m;
            while(z) {
                bool st = true;
                for(int j = V.size() - 1; ~j; --j) {
                    if(V[j].y < Y[i]) {
                        V.erase(V.begin() + j);
                        st = false;
                        z--;
                        break;
                    }
                }
                if(st) break;
            }
        } 
        sort(V.begin(), V.end());
        for(int i = 0; i < A; ++i) {
            int z = m;
            while(z) {
                bool st = true;
                for(int j = V.size() - 1; ~j; --j) {
                    if(V[j].x < X[i]) {
                        V.erase(V.begin() + j);
                        st = false;
                        z--;
                        break;
                    }
                }
                if(st) break;
            }
        }
        if(V.empty()) r = m;
        else l = m+1;
    }
    r = min(r, mn);
    if(r == INF) return -1;
    return r;
}

Compilation message (stderr)

robots.cpp: In function 'int putaway(int, int, int, int*, int*, int*, int*)':
robots.cpp:15:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         int m = l + r >> 1;
                 ~~^~~
robots.cpp:56:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         int m = l + r >> 1;
                 ~~^~~

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