oj.uz

답안 #764600

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
764600 2023-06-23T16:20:42 Z lorenzoferrari Garage (IOI09_garage) C++17
100 / 100
 2 ms 340 KB 
#include "bits/stdc++.h"
using namespace std;
using LL = long long;

int main() {
    int n; cin >> n;
    int m; cin >> m;
    vector<int> r(n), w(m);
    for (int& i : r) cin >> i;
    for (int& i : w) cin >> i;
    vector<int> p(m, -1);
    priority_queue<int, vector<int>, greater<int>> Q;
    for (int i = 0; i < n; ++i) {
        Q.push(i);
    }
    queue<int> q;
    for (int i = 0; i < 2*m; ++i) {
        int c; cin >> c;;
        if (c > 0) {
            if (Q.empty()) {
                q.push(c-1);
            } else {
                p[c-1] = Q.top();
                Q.pop();
            }
        } else {
            Q.push(p[-c-1]);
            if (!q.empty()) {
                p[q.front()] = Q.top();
                Q.pop();
                q.pop();
            }
        }
    }
    int ans = 0;
    for (int i = 0; i < m; ++i) {
        ans += r[p[i]] * w[i];
    }
    cout << ans << "\n";
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 316 KB Output is correct