# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
531506 | bonk | Garage (IOI09_garage) | C++14 | 2 ms | 460 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n, m; cin >> n >> m;
ll r[n + 1], w[m + 1];
vector<int>tmp(n + 1);
priority_queue<int, vector<int>, greater<int>>pq;
queue<int>q;
for(int i = 1; i <= n; i++){
cin >> r[i];
pq.push(i);
}
for(int i = 1; i <= m; i++) cin >> w[i];
ll ans = 0;
for(int i = 0; i < 2*m; i++){
int x; cin >> x;
if(x > 0) q.push(x);
int now = (q.empty()) ? 0 : q.front();
if(x < 0){
pq.push(tmp[-x]);
}
if(now > 0 && !pq.empty()){
tmp[now] = pq.top();
ans += r[pq.top()] * w[now];
pq.pop();
q.pop();
}
}
cout << ans << endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |