# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
766913 | Gabi88 | Garage (IOI09_garage) | C++14 | 1 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;
#define LL long long
set<int> s;
queue<int> q;
LL n, m, rj = 0, val[108], tez[2009], pos[2009], tmp;
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cin >> n >> m;
for(int i=1; i <= n; i++){ s.insert(i); cin >> val[i]; }
for(int i=1; i <= m; i++) cin >> tez[i];
for(int i=0; i < m*2; i++){
cin >> tmp;
if (tmp > 0) q.push(tmp);
else s.insert(pos[-tmp]);
while (s.size() > 0 and q.size() > 0){
rj += tez[q.front()]*val[*s.begin()];
pos[q.front()] = *s.begin();
q.pop();
s.erase(s.begin());
}
}
cout << rj; return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |