# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
239095 | T0p_ | Garage (IOI09_garage) | C++14 | 6 ms | 512 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 park[2020];
long long w[2020], s[110];
queue<int> q;
priority_queue<int> heap;
int main()
{
int n, m;
long long ans = 0;
scanf(" %d %d",&n,&m);
for(int i=1 ; i<=n ; i++)
{
scanf(" %lld",&s[i]);
heap.push(-i);
}
for(int i=1 ; i<=m ; i++)
scanf(" %lld",&w[i]);
m *= 2;
while(m--)
{
int no;
scanf(" %d",&no);
int op = (no < 0) ? 0 : 1;
if(no < 0) no *= -1;
if(op) q.push(no);
else heap.push(-park[no]);
while(!heap.empty() && !q.empty())
{
ans += s[-heap.top()] * w[q.front()];
park[q.front()] = -heap.top();
heap.pop();
q.pop();
}
}
printf("%lld\n",ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |