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