# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
234253 | pere_gil | 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 <iostream>
#include "horses.h"
#include <vector>
using namespace std;
int moe=1000000007;
int ja[5000];
int x[5000];
int y[5000];
int n;
int big=0;
int init(int N, int X[], int Y[])
{
/* por 17 pts
int big=0;
int ja[N];
ja[0]=X[0];
for(int i=1;i<N;i++){
ja[i]=ja[i-1]*X[i];
}
for(int i=0;i<N;i++) big=max(big, ja[i]*Y[i]);
return big;
*/
for(int i=0;i<N;i++){
x[i]=X[i];
y[i]=Y[i];
}
ja=x[0];
big=x[0]*y[0];
for(int i=1;i<n;i++){
big=max((ja[i-1]*x[0]*y[0])%moe, big);
}
return big;
}
int updateX(int pos, int val){
x[pos]=val;
for(int i=pos;i<n;i++) ja[i]=x[i]*ja[i-1]; //actualisar;
for(int i=pos;i<n;i++) big=max(big, (ja[i]*y[i]));
return big;
}
int updateY(int pos, int val){
y[pos]=val;
for(int i=pos;i<n;i++) big=max(big, (ja[i]*y[i]));
return big;
}