제출 #993281

#제출 시각아이디문제언어결과실행 시간메모리
993281vjudge1로봇 (IOI13_robots)C++17
0 / 100
3027 ms348 KiB
#include "robots.h"
#include <bits/stdc++.h>

using namespace std;



int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    multiset<pair<int, int>> st;
    for (int i = 0; i < T; ++i) {
        st.insert({W[i], S[i]});
    }
    int cnt = 0;
    while (!st.empty()) {
        cnt++;
        for (int i = 0; i < A; ++i) {
            auto low = st.lower_bound({X[i], 0});
            if (low == st.begin()) {
                if (i == A - 1) {
                    return -1;
                }
                continue;
            }
            st.erase(--low);
        }
    }
    return cnt;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...