# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
733113 | penguin133 | Garage (IOI09_garage) | C++17 | 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 int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, m, A[105], B[2005];
int a[105];
void solve(){
cin >> n >> m;
for(int i=1;i<=n;i++)cin >> A[i];
for(int i=1;i<=m;i++)cin >> B[i];
queue <int> q;
int ans = 0;
for(int i=1;i<=2*m;i++){
int x; cin >> x;
if(x < 0){
for(int j=1;j<=n;j++){
if(a[j] == -x){
a[j] = 0;
break;
}
}
}
else{
q.push(x);
}
if(q.empty())continue;
int tmp = q.front();
for(int j=1;j<=n;j++){
if(!a[j]){
a[j] = tmp;
ans += A[j] * B[tmp];
q.pop();
break;
}
}
}
cout << ans;
}
main(){
ios::sync_with_stdio(0);cin.tie(0);
int tc = 1;
//cin >> tc;
for(int tc1=1;tc1<=tc;tc1++){
// cout << "Case #" << tc1 << ": ";
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |