#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 102;
bool vis[N];
int pos[N];
int main(){
int n, m; cin >> n >> m;
ll r[n + 1], w[m + 1];
ll ans = 0;
for(int i = 1; i <= n; i++) cin >> r[i];
for(int i = 1; i <= m; i++) cin >> w[i];
queue<int>q;
for(int i = 0; i < 2*m; i++){
int x; cin >> x;
if(x > 0) q.push(x);
else if(x < 0) vis[pos[-x]] = false;
if(!q.empty()){
int now = q.front();
for(int j = 1; j <= n; j++){
if(!vis[j]){
pos[now] = j;
ans += r[j]*w[now];
vis[j] = true;
q.pop();
break;
}
}
}
}
cout << ans << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
204 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
11 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
12 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
13 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
14 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
15 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
16 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
17 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
18 |
Runtime error |
2 ms |
332 KB |
Execution killed with signal 11 |
19 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
20 |
Runtime error |
2 ms |
332 KB |
Execution killed with signal 11 |