# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
310926 | Benmath | Garage (IOI09_garage) | C++14 | 4 ms | 384 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 main(){
int n,m;
cin>>n>>m;
long long int a[n];
long long int b[m];
int d[n];
int vis[n];
for(int i=0;i<n;i++){
cin>>a[i];
vis[i]=0;
}
for(int i=0;i<m;i++){
cin>>b[i];
d[i]=-1;
}
long long int sum=0;
queue<int>q;
for(int i=0;i<2*m;i++){
int x;
cin>>x;
if(x>0){
int brojac=0;
q.push(x);
}else{
x=abs(x);vis[d[x-1]]--;
d[x-1]=-1;
}
if(!q.empty()){
int l=q.front();
q.pop();
for(int j=0;j<n;j++){
if(vis[j]==0){
sum=sum+a[j]*b[l-1];
vis[j]++;
d[l-1]=j;
break;
}
}
}
}
cout<<sum;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |