#include<bits/stdc++.h>
#define maxn 110
#define maxm 2010
using namespace std;
int n,m;
int r[maxn],w[maxm],where[maxn];
bool is[maxn];
int ans=0;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>m;
for(int i=0;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 curr;
cin>>curr;
if(curr<0)
{
curr*=-1;
is[where[curr]]=0;
continue;
}
q.push(curr);
for(int i=0;i<n;i++)
{
if(q.size()==0) break;
if(is[i]==0)
{
ans+=r[i]*w[curr];
where[curr]=i;
is[i]=1;
q.pop();
}
}
}
cout<<ans<<"\n";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
11 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
12 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
13 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
14 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
15 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
16 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
17 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
18 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
19 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
20 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |