# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
212276 | jk89 | Garage (IOI09_garage) | C++14 | 7 ms | 512 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 <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
using namespace std;
#define f first
#define s second
const int MAXN = 1e2 + 3;
const int MAXM = 2e3 + 3;
int c[MAXN];
int w[MAXM];
int msc[MAXM];
set<int> q;
queue<int> kol;
int main() {
int n, m, x;
int wyn = 0;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &c[i]);
q.insert(i);
}
for (int i = 1; i <= m; i++)
scanf("%d", &w[i]);
for (int i = 1; i <= 2 * m; i++) {
scanf("%d", &x);
if (x > 0) {
if (q.empty())
kol.push(x);
else {
wyn += w[x] * c[*q.begin()];
msc[x] = *q.begin();
q.erase(q.begin());
}
}
else {
x = -x;
q.insert(msc[x]);
if (!kol.empty()) {
q.erase(q.begin());
wyn += w[kol.front()] * c[msc[x]];
msc[kol.front()] = msc[x];
kol.pop();
}
}
}
printf("%d", wyn);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |