# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
954452 | irmuun | Horses (IOI15_horses) | C++17 | 0 ms | 0 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>
#include "horses.h"
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
const int mod=1e9+7;
int init(int N,int X[],int Y[]){
int ans=0,cnt=1;
for(int i=0;i<N;i++){
int cur=1;
cnt*=X[i];
bool sell=true;
for(int j=i+1;j<N;j++){
cur*=X[j];
if(1ll*cur*Y[j]>1ll*Y[i]){
sell=false;
break;
}
}
if(sell){
return cnt*Y[i];
}
}
return 0;
}
int updateX(int pos,int val){
return 0;
}
int updateY(int pos,int val){
return 0;
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n;
cin>>n;
int x[n],y[n];
for(int i=0;i<n;i++) cin>>x[i];
for(int i=0;i<n;i++) cin>>y[i];
cout<<init(n,x,y);
}