Submission #56049

#	Time	Username	Problem	Language	Result	Execution time	Memory
56049		aquablitz11	Robots (IOI13_robots)	C++14	14 / 100	205 ms	9084 KiB

robots

#include <bits/stdc++.h>
#include "robots.h"
using namespace std;

#define forn(i, n) for (int i = 0; i < (n); ++i)
#define F first
#define S second
typedef pair<int, int> pii;

const int N = 50010;
const int INF = 2e9+1;

bool used[N];

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[])
{
    int tim = 0, done = 0;
    bool ok = true;
    while (ok) {
        ++tim;
        ok = false;
        forn(i, A) {
            pii mx(-1, -1);
            forn(j, T) if (!used[j] && W[j] < X[i])
                mx = max(mx, pii(S[j], j));
            if (mx != pii(-1, -1)) {
                used[mx.S] = true;
                ok = true;
                ++done;
                continue;
            }
        }
        forn(i, B) {
            pii mx(-1, -1);
            forn(j, T) if (!used[j] && S[j] < Y[i])
                mx = max(mx, pii(W[j], j));
            if (mx != pii(-1, -1)) {
                used[mx.S] = true;
                ok = true;
                ++done;
                continue;
            }
        }
        if (done == T)
            return tim;
    }
    return -1;
}

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