# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
508730 | tabr | Garage (IOI09_garage) | C++17 | 2 ms | 444 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;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> r(n);
for (int i = 0; i < n; i++) {
cin >> r[i];
}
vector<int> w(m);
for (int i = 0; i < m; i++) {
cin >> w[i];
}
queue<int> que;
vector<int> c(n, -1);
int ans = 0;
for (int i = 0; i < 2 * m; i++) {
int x;
cin >> x;
if (x > 0) {
x = x - 1;
que.emplace(x);
} else {
x = -x - 1;
for (int j = 0; j < n; j++) {
if (c[j] == x) {
c[j] = -1;
}
}
}
while (!que.empty() && *min_element(c.begin(), c.end()) == -1) {
x = que.front();
que.pop();
for (int j = 0; j < n; j++) {
if (c[j] == -1) {
c[j] = x;
ans += r[j] * w[x];
break;
}
}
}
}
cout << ans << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |