| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 334697 | blue | 말 (IOI15_horses) | C++17 | 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 "horses.h"
#include <algorithm>
using namespace std;
int N;
int* X;
int* Y;
int answer()
{
long long product_X[N];
product_X[0] = X[0];
for(int i = 1; i < N; i++) product_X[i] = (product_X[i-1] * X[i]) % mod;
int y = 0;
int res = 0;
for(int i = N-1; i >= 0; i--)
{
y = max(y, Y[i]);
res = max(res, int((product_X[i] * y) % mod));
}
return res;
}
int init(int n, int x[], int y[])
{
N = n;
X = x;
Y = y;
return answer();
}
int updateX(int pos, int val)
{
X[pos] = val;
return answer();
}
int updateY(int pos, int val)
{
Y[pos] = val;
return answer();
}
