# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
346484 | MilosMilutinovic | Garage (IOI09_garage) | C++14 | 3 ms | 492 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.
/**
* author: milos
* created: 10.01.2021 01:24:34
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(m);
for (int i = 0; i < m; i++) {
cin >> b[i];
}
vector<int> que;
vector<int> p(n);
iota(p.begin(), p.end(), 0);
vector<int> l(m);
for (int i = 0; i < 2 * m; i++) {
int x;
cin >> x;
if (x > 0) {
--x;
if (!p.empty()) {
sort(p.begin(), p.end());
l[x] = p[0];
p.erase(p.begin());
} else {
que.push_back(x);
}
} else {
x = -x;
--x;
if (!que.empty()) {
l[que[0]] = l[x];
que.erase(que.begin());
} else {
p.push_back(l[x]);
}
}
}
long long ans = 0;
for (int i = 0; i < m; i++) {
ans += a[l[i]] * b[i];
}
cout << ans << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |