# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
545589 | pere_gil | Garage (IOI09_garage) | C++17 | 1 ms | 340 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;
int main(){
int n,m; scanf("%d %d",&n,&m);
vector<int> r(n+1);
for(int i=1;i<=n;i++) scanf("%d",&r[i]);
vector<int> h(m+1);
for(int i=1;i<=m;i++) scanf("%d",&h[i]);
queue<int> car;
priority_queue<int,vector<int>,greater<int>> parking;
for(int i=n;i>0;i--) parking.push(i);
vector<int> v(m+1);
m*=2;
long long res=0;
while(m--){
int act; scanf("%d",&act);
if(act>0){
if(parking.empty()) car.push(act);
else{
v[act]=parking.top();
parking.pop();
res+=h[act]*r[v[act]];
}
}
else{
parking.push(v[-act]);
if(!car.empty()){
act=car.front(); car.pop();
v[act]=parking.top();
parking.pop();
res+=h[act]*r[v[act]];
}
}
}
printf("%lld\n",res);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |