# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
275825 | barsbold | Garage (IOI09_garage) | C++14 | 2 ms | 512 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>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
using namespace std;
int r[101];
int w[101];
int s[202];
int vis[101];
int res =0;
int n , m;
int main(){
cin >> n;
cin >>m;
memset(vis , 0 , sizeof(vis));
vector<int> wait;
for(int i = 1; i<=n; i++){
cin >> r[i];
}
for(int i = 1; i<=m; i++){
cin >> w[i];
}
for(int i = 1; i<=m * 2; i++){
int tmp;
cin >> tmp;
if(tmp > 0){
bool flag =true;
for(int i = 1; i<=n; i++){
if(vis[i] == 0){
res+=r[i] * w[tmp];
vis[i] = tmp;
flag = false;
break;
}
}
if(flag) wait.pb(tmp);
}
else {
int sul ;
for(int i = 1; i<=n; i++){
if(vis[i] == tmp * (-1)){
vis[i] = 0;
sul = i;
}
}
if(wait.size()!=0) {
res+=w[wait[0]] * r[sul];
wait.erase(wait.begin());
}
}
}
cout << res << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |