# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
307259 | vipghn2003 | Horses (IOI15_horses) | C++14 | 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>
using namespace std;
long long init(int N,int X[],int Y[])
{
long long res;
for(int i=0;i<N;i++)
{
long long cur=1;
int id=-1;
for(int j=i+1;j<N;j++)
{
cur*=X[j];
if(cur*Y[j]>=Y[i])
{
id=j;
break;
}
}
if(id==-1)
{
res=y[i];
for(int j=0;j<=i;j++) res*=x[i];
}
else i=j-1;
}
return res;
}
long long updateX(int pos,int val)
{
return 0;
}
long long updateY(int pos,int val)
{
return 0;
}
/*
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
}
*/