# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
733884 | vjudge1 | Garage (IOI09_garage) | C++17 | 2 ms | 340 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 ans, a[101], b[2001], n, m, x, vis[2001];
set<int> s;
set<int>::iterator it;
vector<int> v;
int main() {
cin >> n >> m;
for(int i = 1; i <= n; i++) {
cin >> a[i];
s.insert(i);
}
for(int i = 1; i <= m; i++) {
cin >> b[i];
}
for(int i = 1; i <= m * 2; i++) {
cin >> x;
if(x < 0) {
s.insert(vis[x * -1]);
if(v.size() != 0) {
it = s.begin();
vis[v[0]] = *it;
ans += a[*it] * b[v[0]];
s.erase(it);
v.erase(v.begin());
}
}
else {
v.push_back(x);
if(s.size() != 0){
it = s.begin();
vis[v[0]] = *it;
ans += a[*it] * b[v[0]];
// cout << a[*it] << ' ' << b[v[0]] << '\n';
s.erase(it);
v.erase(v.begin());
}
}
}
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |