# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135399 | tinjyu | Horses (IOI15_horses) | C++14 | 1532 ms | 15992 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 "horses.h"
#include <iostream>
using namespace std;
long long int n,x[1000005],y[1000005];
int init(int N, int X[], int Y[]) {
n=N;
for(int i=0;i<n;i++)x[i]=X[i];
for(int i=0;i<n;i++)y[i]=Y[i];
long long int ans=0,tmp=1;
for(int i=1;i<n;i++)
{
double t=(double)y[ans]/double(y[i]);
if(tmp<1000000000)tmp*=x[i];
if(tmp>=t)
{
ans=i;
tmp=1;
}
}
long long int a=y[ans];
for(int i=0;i<=ans;i++)
{
a*=x[i];
a%=1000000007;
}
return a;
}
int updateX(int pos, int val) {
x[pos]=val;
long long int ans=0,tmp=1;
for(int i=1;i<n;i++)
{
double t=(double)y[ans]/double(y[i]);
if(tmp<1000000000)tmp*=x[i];
if(tmp>=t)
{
ans=i;
tmp=1;
}
}
long long int a=y[ans];
for(int i=0;i<=ans;i++)
{
a*=x[i];
a%=1000000007;
}
return a;
}
int updateY(int pos, int val) {
y[pos]=val;
long long int ans=0,tmp=1;
for(int i=1;i<n;i++)
{
double t=(double)y[ans]/double(y[i]);
if(tmp<1000000000)tmp*=x[i];
if(tmp>=t)
{
ans=i;
tmp=1;
}
}
long long int a=y[ans];
for(int i=0;i<=ans;i++)
{
a*=x[i];
a%=1000000007;
}
return a;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |