# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1089046 | kokoue | Garage (IOI09_garage) | C++14 | 2 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define maxn 110
#define maxm 2010
#define ll long long
using namespace std;
ll n,m;
ll r[maxn],w[maxm],where[maxm];
bool is[maxn];
ll ans=0;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n>>m;
for(ll i=0;i<n;i++)
{
cin>>r[i];
}
for(ll i=1;i<=m;i++)
{
cin>>w[i];
}
queue<ll> q;
for(ll i=0;i<2*m;i++)
{
ll curr;
cin>>curr;
if(curr<0)
{
curr*=-1;
is[where[curr]]=0;
continue;
}
q.push(curr);
for(ll 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";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |