oj.uz

Submission #1016142

# Submission time Handle Problem Language Result Execution time Memory
1016142 2024-07-07T12:40:32 Z socpite Garage (IOI09_garage) C++14
100 / 100
 1 ms 760 KB 
#include<bits/stdc++.h>
using namespace std;

const int maxn = 2005;

int n, m;
int id[maxn], R[maxn], W[maxn];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    priority_queue<int, vector<int>, greater<int>> pq;
    for(int i = 1; i <= n; i++){
        cin >> R[i];
        pq.push(i);
    }
    queue<int> q;
    int ans = 0;
    for(int i = 1; i <= m; i++)cin >> W[i];
    for(int i = 1; i <= 2*m; i++){
        int x;
        cin >> x;
        if(x > 0)q.push(x);
        else pq.push(id[-x]);
        while(!q.empty() && !pq.empty()){
            id[q.front()] = pq.top();
            ans += W[q.front()]*R[pq.top()];
            pq.pop();
            q.pop();
        }
    }
    cout << ans;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 456 KB Output is correct
9 Correct 1 ms 760 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct