# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
114235 | nvmdava | Garage (IOI09_garage) | C++17 | 4 ms | 384 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;
int w[2001], p[101], loc[2001];
set<int> pos;
queue<int> q;
int main(){
int n, m;
cin>>n>>m;
for(int i = 1; i <= n; i++){
cin>>p[i];
pos.insert(i);
}
for(int i = 1; i <= m; i++){
cin>>w[i];
}
for(int i = 1; i <= 2 * m; i++){
int k;
cin>>k;
if(k > 0) q.push(k);
else pos.insert(loc[-k]);
while(pos.size() && !q.empty()){
int a = *pos.begin();
loc[q.front()] = a;
pos.erase(pos.begin());
q.pop();
}
}
long long ans = 0;
for(int i = 1; i <= m; i++){
ans += (long long)w[i] * p[loc[i]];
}
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |