# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
199841 | aggu_01000101 | Garage (IOI09_garage) | C++14 | 7 ms | 408 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 <iostream>
#include <queue>
#define int long long
using namespace std;
int32_t main(){
int n, m;
cin>>n>>m;
int rate[n];
for(int i = 0;i<n;i++) cin>>rate[i];
int w[m+1];
for(int i = 1;i<=m;i++) cin>>w[i];
int ans = 0;
bool used[n];
for(int i =0 ;i<n;i++) used[i] = false;
queue<int> q;
int val[m+1];
for(int i = 1;i<=m;i++) val[i] = -1;
int rev = 0;
for(int i = 0;i<(2*m);i++){
int x;
cin>>x;
if(x>0){
q.push(x);
}
else{
used[val[-x]] = false;
}
if(q.empty()) continue;
for(int j = 0;j<n;j++){
if(used[j]==false){
//cout<<q.front()<<" "<<(j+1)<<" "<<rate[j]<<" "<<w[q.front()]<<endl;
val[q.front()] = j;
used[j] = true;
rev+=(w[q.front()]*rate[j]);
q.pop();
goto last;
}
}
last:
continue;
//cout<<rev<<endl;
}
cout<<rev<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |