Submission #717695

#TimeUsernameProblemLanguageResultExecution timeMemory
717695AndrijaMGarage (IOI09_garage)C++14
40 / 100
3 ms340 KiB
#include <bits/stdc++.h> using namespace std; int main() { int ans=0; int n,m; cin>>n>>m; int cpp[n]; map<int,int>l; bool vis[n]; for(int i=0;i<n;i++) { cin>>cpp[i]; vis[i]=false; } int mass[m]; for(int i=0;i<m;i++) { cin>>mass[i]; } int idx; for(int i=0;i<2*m;i++) { cin>>idx; if(idx>0) { for(int pos=0;pos<n;pos++) { if(vis[pos]==false) { ans+=cpp[pos]*mass[idx-1]; l[idx]=pos; vis[pos]=true; break; } } } else { vis[l[idx*(-1)]]=false; } } cout<<ans<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...