# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
717712 |
2023-04-02T11:14:05 Z |
AndrijaM |
Garage (IOI09_garage) |
C++14 |
|
3 ms |
440 KB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long ans=0;
long long n,m;
cin>>n>>m;
long long cpp[n];
map<long long,long long>l;
bool vis[n];
for(long long i=0;i<n;i++)
{
cin>>cpp[i];
vis[i]=false;
}
long long mass[m];
for(long long i=0;i<m;i++)
{
cin>>mass[i];
}
long long idx;
queue<long long>Q;
for(long long i=0;i<2*m;i++)
{
cin>>idx;
if(idx>0)
{
idx--;
bool ok=false;
for(long long pos=0;pos<n;pos++)
{
if(vis[pos]==false)
{
ans+=cpp[pos]*mass[idx];
l[idx]=pos;
vis[pos]=true;
ok=true;
break;
}
}
if(!ok)
{
Q.push(idx);
}
}
else
{
idx*=(-1);
idx--;
if(Q.size()>0)
{
ans+=cpp[l[idx]]*mass[Q.front()];
Q.pop();
}
else
{
vis[l[idx]]=false;
}
}
}
cout<<ans<<endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
296 KB |
Output is correct |
2 |
Incorrect |
1 ms |
300 KB |
Output isn't correct |
3 |
Correct |
1 ms |
296 KB |
Output is correct |
4 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
7 |
Correct |
1 ms |
300 KB |
Output is correct |
8 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
15 |
Correct |
2 ms |
336 KB |
Output is correct |
16 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |
17 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |
18 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |
19 |
Incorrect |
2 ms |
440 KB |
Output isn't correct |
20 |
Incorrect |
3 ms |
340 KB |
Output isn't correct |