# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
319381 | Dan4Life | Garage (IOI09_garage) | C++17 | 4 ms | 492 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;
#define int long long
int32_t main()
{
int n, m;
cin >> n >> m;
vector<int> v(n+5, 0);
int a[1000];
for(int i = 0; i < n; i++) cin >> a[i];
map<int,int> M;
for(int i = 0; i < m; i++) cin >> M[i+1];
queue<int> Q;
int cnt = 0, ans = 0;
for(int i = 0; i < 2*m; i++)
{
int x; cin >> x;
if(x>0)
{
if(cnt==n) Q.push(x);
else{
cnt++;
for(int j = 0; j < n; j++)
{
if(v[j]) continue;
v[j]=x, ans+=a[j]*M[x];
break;
}
}
}
else{
x*=-1;
for(int j = 0; j < n; j++)
{
if(v[j]!=x) continue;
v[j]=0, cnt--;
if(!Q.empty()){
int z = Q.front(); Q.pop();
v[j]=z, ans+=a[j]*M[z], cnt++;
}
}
}
}
cout << ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |