# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597012 | hail | Garage (IOI09_garage) | C++17 | 2 ms | 468 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()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin>>n>>m;
ll rate[101];
ll weight[2001];
priority_queue<int, vector<int>, greater<int>> park_space;
for(int i=1; i<=n; i++)
{
cin>>rate[i];
park_space.push(i);
}
for(int i=1; i<=m; i++)
{
cin>>weight[i];
}
map<int, int> car_park;
long long earnings{};
queue<int> car_q;
int car;
for(int i=1; i<=2*m; i++)
{
cin>>car;
if(car>0)
{
car_q.push(car);
}
else
{
park_space.push(car_park[abs(car)]);
}
while((not park_space.empty())&&(not car_q.empty()))
{
car_park.insert(make_pair(car_q.front(), park_space.top()));
earnings+= (weight[car_q.front()])*(rate[park_space.top()]);
car_q.pop();
park_space.pop();
}
}
cout<<earnings;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |