Submission #795756

#	Time	Username	Problem	Language	Result	Execution time	Memory
795756		Username4132	Horses (IOI15_horses)	C++14	17 / 100	12 ms	8288 KiB

horses

#include "horses.h"
#include<iostream>
#include<cmath>
using namespace std;
using ll = long long;
using ld = long double;
#define forn(i, n) for(int i=0; i<(int)n; ++i)

const int MAXN = 1010, MOD = 1000000007;
int n, arr[MAXN], brr[MAXN];

int calc(){
	int prod=1, mx=0;
	forn(i, n) prod*=arr[i], mx=max(mx, prod*brr[i]);
	return mx;
}

int init(int N, int X[], int Y[]) {
	n=N;
	forn(i, n) arr[i]=X[i], brr[i]=Y[i];
	return calc();
}

int updateX(int pos, int val) {	
	arr[pos]=val;
	return calc();
}

int updateY(int pos, int val) {
	brr[pos]=val;
	return calc();
}

• Subtask 1: 17 / 17
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 23
• Subtask 5: 0 / 23