# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
879052 | klee | Garage (IOI09_garage) | C++14 | 3 ms | 376 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 main() {
int a,b;
int counter=0;
queue <int> q;
cin >> a;
cin >> b;
int price[a+1];
int slot[a+1];
for(int i=1; i<=a; i++) {
int x;
cin >> x;
price[i] = x;
}
for(int i=1;i<=a; i++) {
slot[i] = 0;
}
int weight[b+1];
for(int i=1;i<=b; i++) {
int x;
cin >> x;
weight[i] = x;
}
for(int i=1;i<=2*b; i++) {
int y;
cin >> y;
if(y>0) {
q.push(y);
for(int i=1; i<=a; i++) {
if((slot[i]==0)&&(!q.empty())) {
slot[i]=q.front();
q.pop();
}
}
}
else {
int g;
for(int i=1;i<=a; i++) {
if(slot[i]==y*-1) {
g = i;
slot[i] = 0;
}
}
for(int i=1; i<=a; i++) {
if((slot[i]==0)&&(!q.empty())) {
slot[i]=q.front();
q.pop();
}
}
counter+= (price[g]*weight[-1*y]);
}
}
cout << counter;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |