| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 135408 | StevenH | Horses (IOI15_horses) | C++14 | 18 ms | 8696 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 s[10000];
long long mx=-1;
int n;
int x[10000],y[10000];
int init(int N, int X[], int Y[]) {
	n=N;
	s[0]=X[0];
	x[0]=X[0];
	y[0]=Y[0];
	mx = s[0]*Y[0];
	for(int i=1;i<N;i++)
	{
		x[i]=X[i];
		y[i]=Y[i];
		s[i]=s[i-1]*X[i];
		if(s[i]*Y[i]>mx)mx=s[i]*Y[i];
	}
	return mx%1000000007;
}
int updateX(int pos, int val) {	
	x[pos]=val;
	if(pos==0)
	{
		s[0]=x[0];
		if(x[0]*y[0]>mx)
			mx=x[0]*y[0];
	}
	for(int i=max(pos,1);i<n;i++)
		s[i]=s[i-1]*x[i];
	
	mx=-1;
	for(int i=0;i<n;i++)
	{
		if(s[i]*y[i]>mx)mx=s[i]*y[i];
	}
	return mx%1000000007;
}
int updateY(int pos, int val) {
	y[pos]=val;
	mx=-1;
	for(int i=0;i<n;i++)
		if(s[i]*y[i]>mx)
			mx=s[i]*y[i];
	return mx%1000000007;
}
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... | ||||
