제출 #989797

#제출 시각아이디문제언어결과실행 시간메모리
989797aaaaaarrozGarage (IOI09_garage)C++17
100 / 100
2 ms436 KiB
#include <bits/stdc++.h>
using namespace std;
int main() {
    int n, m;
    cin >> n >> m;
    vector<int> rate(n);
    for (int i = 0; i < n; i++) {
        cin >> rate[i];
    }
    vector<int> weight(m);
    for (int i = 0; i < m; i++) {
        cin >> weight[i];
    }
    queue<int> cola;
    vector<bool> ocupado(n, false);
    map<int, int> espacio;
    int ganancia = 0;
    int q = 2 * m;
    while (q--) {
        int v;
        cin >> v;
        if (v >= 1) {
            v--;
            int peso = weight[v];
            bool encontrado = false;
            for (int i = 0; i < n; i++) {
                if (!ocupado[i]) {
                    ocupado[i] = true;
                    espacio[v] = i;
                    ganancia += (rate[i] * peso);
                    encontrado = true;
                    break;
                }
            }
            if (!encontrado) {
                cola.push(v);
            }
        } else {
            v = -v - 1;
            int i = espacio[v];
            ocupado[i] = false;
            if (!cola.empty()) {
                int nextCar = cola.front();
                cola.pop();
                int peso = weight[nextCar];
                ocupado[i] = true;
                espacio[nextCar] = i;
                ganancia += (rate[i] * peso);
            }
        }
    }
    cout << ganancia << "\n";
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...