#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
int32_t main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int N, M; cin >> N >> M;
vector<int> prices(N + 1), cars(M + 1);
for(int i = 1; i <= N; i++) cin >> prices[i];
for(int i = 1; i <= M; i++) cin >> cars[i];
set<int> free;
for(int i = 1; i <= N; i++) {
free.insert(i);
}
deque<int> line;
map<int, int> spots;
int ans = 0;
for(int i = 0; i < 2 * M; i++) {
int step; cin >> step;
if(step > 0) {
if(free.empty()) {
line.push_back(step);
continue;
}
assert(!free.empty());
int space = *free.begin();
free.erase(*free.begin());
ans += cars[step] * prices[space];
spots[step] = space;
}else {
free.insert(spots[-step]);
if(!line.empty()) {
int car = *line.begin();
ans += cars[car] * prices[spots[-step]];
line.pop_front();
}
}
}
cout << ans << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
11 |
Correct |
1 ms |
332 KB |
Output is correct |
12 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
15 |
Correct |
2 ms |
332 KB |
Output is correct |
16 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
17 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
18 |
Incorrect |
3 ms |
332 KB |
Output isn't correct |
19 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |
20 |
Incorrect |
2 ms |
332 KB |
Output isn't correct |