#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m; cin >> n >> m;
int carpark = 0;
vector<int> v(n,0), rate(n), weight(m);
for(auto &i : rate)cin >> i;
for(auto &i : weight)cin >> i;
queue<int> overflow;
vector<int> used(m,-1);
int ans = 0;
for(int i = 0; i < 2*m; ++i){
int x; cin >> x;
if(x < 0){
if(overflow.size()){
int w = overflow.front();
overflow.pop();
ans+=weight[w]*rate[used[-x-1]];
used[w] = used[-x-1];
}
else{
v[used[-x-1]] = 0;
carpark--;
}
}
else{
if(carpark == n){
overflow.push(x-1);
}
else{
carpark++;
for(int j = 0; j < n; ++j){
if(!v[j]){
v[j] = 1;
ans+=weight[x-1]*rate[j];
used[x-1] = j;
break;
}
}
}
}
}
cout << ans << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
0 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
0 ms |
256 KB |
Output is correct |
6 |
Correct |
0 ms |
256 KB |
Output is correct |
7 |
Correct |
0 ms |
256 KB |
Output is correct |
8 |
Correct |
1 ms |
256 KB |
Output is correct |
9 |
Correct |
1 ms |
256 KB |
Output is correct |
10 |
Correct |
1 ms |
256 KB |
Output is correct |
11 |
Correct |
1 ms |
288 KB |
Output is correct |
12 |
Correct |
1 ms |
256 KB |
Output is correct |
13 |
Correct |
1 ms |
256 KB |
Output is correct |
14 |
Correct |
1 ms |
256 KB |
Output is correct |
15 |
Correct |
2 ms |
256 KB |
Output is correct |
16 |
Correct |
3 ms |
384 KB |
Output is correct |
17 |
Correct |
3 ms |
384 KB |
Output is correct |
18 |
Correct |
3 ms |
384 KB |
Output is correct |
19 |
Correct |
3 ms |
384 KB |
Output is correct |
20 |
Correct |
4 ms |
384 KB |
Output is correct |