# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
620846 | A_D | Horses (IOI15_horses) | C++14 | 12 ms | 8388 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;
const int N=1e3+100;
long long x[N];
long long y[N];
const long long MOD=1e9+7;
int n;
int getans()
{
long long ret=0,sum=1,sum2=1,val=0;
for(int i=0;i<n;i++){
sum*=x[i];
sum2*=x[i];
if(sum2*y[i]>val){
ret=(sum*y[i])%MOD;
sum2=1;
val=y[i];
}
}
return (int)ret;
}
int init(int N, int X[], int Y[]){
n=N;
for(int i=0;i<n;i++){
x[i]=X[i];
y[i]=Y[i];
}
return getans();
}
int updateX(int pos, int val) {
x[pos]=val;
return getans();
}
int updateY(int pos, int val) {
y[pos]=val;
return getans();
}
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... |