#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n,m;
cin >> n >> m;
vector<int> r(n+1,0);
for(int i=1;i<=n;i++) cin >> r[i];
vector<int> w(m+1,0);
for(int i=1;i<=m;i++) cin >> w[i];
vector<int> v(n+1,0);
vector<int> pos(m+1,0);
queue<int> q;
int res=0;
for(int i=1;i<=2*m;i++)
{
int a;
cin >> a;
if(a>0)
{
int p=1;
while(p<=n&&v[p]==1) p++;
if(p<=n)
{
res+=(r[p]*w[a]);
v[p]=1;
pos[a]=p;
}
else q.push(a);
}
else
{
a=-a;
int p=pos[a];
v[p]=0;
if(!q.empty())
{
int b=q.front();
q.pop();
res+=(r[p]*w[b]);
pos[b]=p;
v[p]=1;
}
}
}
cout << res << "\n";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
0 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
1 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
212 KB |
Output is correct |