Submission #1172645

#	Time	Username	Problem	Language	Result	Execution time	Memory
1172645		HappyCapybara	Horses (IOI15_horses)	C++17	0 / 100	1595 ms	8008 KiB

horses

#include "horses.h"
#include<bits/stdc++.h>
using namespace std;

#define ll __int128

ll m = 1000000009;
int n;
vector<int> x, y;

int solve(){
	ll cur = 1, cy, cx, bsf;
	for (int i=0; i<n; i++){
		if (i == 0){
			cur = (cur*x[i]) % m;
			cy = y[i];
			cx = 1;
			bsf = (cur*y[i]) % m;
			continue;
		}
		cur = (cur*x[i]) % m;
		cx *= x[i];
		if (cx * y[i] > cy){
			bsf = (cur*y[i]) % m;
			cy = y[i];
			cx = x[i];
		}
	}
	return bsf;
}

int init(int N, int X[], int Y[]){
	n = N;
	x.resize(n);
	y.resize(n);
	for (int i=0; i<n; i++){
		x[i] = X[i];
		y[i] = Y[i];
	}
	return solve();
}

int updateX(int pos, int val){
	x[pos] = val;
	return solve();
}

int updateY(int pos, int val){
	y[pos] = val;
	return solve();
}

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