# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
430226 | Abdulmohsen1284 | Horses (IOI15_horses) | C++14 | 43 ms | 16904 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 <bits/stdc++.h>
using namespace std;
long long ma=0,mod=1000000007;
long long x[1000005],y[1000005],n,all[500005];
int init(int N, int X[], int Y[]) {
long long horse=1;
n=N;
for(int i=0;i<N;i++)
{
all[i+1]=X[i]*all[i];
x[i]=X[i];
y[i]=Y[i];
}
int st=n-30;
long long bef=0;
if(st<0)
st=0;
for(int i=st;i<n;i++)
{
horse*=x[i];
if(horse*y[i]>=bef)
{
bef=y[i];
horse=1;
ma=(horse*y[i])%mod;
}
}
return ma;
}
int updateX(int pos, int val) {
x[pos]=val;
int st=n-30;
long long horse=1,bef=0;
if(st<0)
st=0;
for(int i=st;i<n;i++)
{
horse*=x[i];
if(horse*y[i]>=bef)
{
bef=y[i];
horse=1;
ma=(horse*y[i])%mod;
}
}
return ma;
}
int updateY(int pos, int val) {
y[pos]=val;
long long horse=1;
int st=n-30;
long long bef=0;
if(st<0)
st=0;
for(int i=st;i<n;i++)
{
horse*=x[i];
if(horse*y[i]>=bef)
{
bef=y[i];
horse=1;
ma=(horse*y[i])%mod;
}
}
return ma;
}
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... |