Submission #1016017

#TimeUsernameProblemLanguageResultExecution timeMemory
1016017AliHasanliGarage (IOI09_garage)C++17
100 / 100
1 ms404 KiB
#include <bits/stdc++.h> using namespace std; int main(){ long long n,m,r(0); cin >> n >> m; vector<long long> A(n),B(m),C(m); set<long long> s; queue<long long> que; for (long long i(0);i < n;++i) s.emplace(i); for (long long &a:A) cin >> a; for (long long &a:B) cin >> a; for (long long l(0),i;l < 2*m;++l){ cin >> i; if (i>0) que.emplace(i-1); else s.emplace(C[abs(i)-1]); if (!que.empty()&&!s.empty()) r+=B[que.front()]*A[*s.begin()],C[que.front()]=*s.begin(),que.pop(),s.erase(s.begin()); } cout << r << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...