Submission #718789

#TimeUsernameProblemLanguageResultExecution timeMemory
718789NintsiChkhaidzeGarage (IOI09_garage)C++17
100 / 100
1 ms376 KiB
#include <bits/stdc++.h> #define pb push_back #define ll long long #define f first #define s second #define int ll using namespace std; const int N = 2e3 + 5; int val[N],w[N],p[N]; queue <int> q; set <int> st; signed main() { ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL); int n,m; cin>>n>>m; for (int i=1;i<=n;i++){ st.insert(i); cin>>val[i]; } for (int i=1;i<=m;i++) cin>>w[i]; int ans=0; for (int i= 1;i<=2*m;i++){ int x; cin>>x; if(x > 0){ q.push(x); }else{ st.insert(p[-x]); } while (st.size() && q.size()){ int x = q.front(),id = *st.begin(); q.pop(); p[x] = id; ans += val[id] * w[x]; st.erase(st.begin()); } } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...