#include <bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(int i = a; i < b; i++)
int n, m, x, ans, rate[105], w[2005], place[2005], freee;
bool on[105];
int main(){
cin >> n >> m;
f(i,1,n+1) cin >> rate[i];
f(i,1,m+1) cin >> w[i];
freee = n;
queue <int> q;
f(i,0,2*m){
cin >> x;
if(x < 0){
on[place[-x]] = 0, freee++;
while(!q.empty()){
if(freee == 0) break;
int t = q.front();
f(j,1,n+1){
if(!on[j]) {
place[x] = j, on[j] = 1, ans += rate[j]*w[t];
break;
}
}
q.pop(), freee--;
}
continue;
}
else{
q.push(x);
while(!q.empty()){
if(freee == 0) break;
int t = q.front();
f(j,1,n+1){
if(!on[j]) {
place[x] = j, on[j] = 1, ans += rate[j]*w[t];
break;
}
}
q.pop(), freee--;
}
}
}
cout << ans << endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Incorrect |
1 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 |
0 ms |
204 KB |
Output is correct |
8 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 6 |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Runtime error |
1 ms |
332 KB |
Execution killed with signal 11 |
13 |
Correct |
1 ms |
204 KB |
Output is correct |
14 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
17 |
Runtime error |
2 ms |
332 KB |
Execution killed with signal 11 |
18 |
Runtime error |
2 ms |
332 KB |
Execution killed with signal 11 |
19 |
Runtime error |
2 ms |
332 KB |
Execution killed with signal 11 |
20 |
Runtime error |
2 ms |
332 KB |
Execution killed with signal 11 |