# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
866268 | lomta | Garage (IOI09_garage) | C++17 | 3 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>
using namespace std;
#define int long long
queue<int> q;
set<int> st;
main(){
int n;cin>>n;
int m;cin>>m;
vector<int> v1(n);
for(int i=0;i<n;i++){
cin>>v1[i];
st.insert(i);
}
vector<int> v(m);
for(int i=0;i<m;i++){
cin>>v[i];
}
int ans=0;
m*=2;
map<int,int> mp;
while(m--){
int x;cin>>x;
if(x>0){
x--;
q.push(x);
if(st.size()==0){
continue;
}
else{
int k=*st.begin();
auto l=st.find(k);
st.erase(l);
int kk=q.front();
q.pop();
ans+=v1[k]*v[kk];
mp[kk]=k;
//cout<<"k:"<<v[kk]<<" "<<k<<endl;
}
}
else{
x++;
int out=mp[abs(x)];
st.insert(out);
if(q.size()>0){
int kk=q.front();
q.pop();
int k=*st.begin();
auto l=st.find(k);
st.erase(l);
ans+=v1[k]*v[kk];
mp[kk]=k;
}
}
//cout<<"ans:"<<ans<<endl;
}
cout<<ans<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |