Submission #999521

#	Time	Username	Problem	Language	Result	Execution time	Memory
999521		Alfraganus	Horses (IOI15_horses)	C++17	17 / 100	1547 ms	11468 KiB

horses

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

const int mod = 1e9 + 7;
vector<int> x, y;

int init(int n, int X[], int Y[]) {
	for(int i = 0; i < n; i ++)
		x.push_back(X[i]);
	for(int i = 0; i < n; i ++)
		y.push_back(Y[i]);
	int ans = 1, p = 1;
	for(int i = 0; i < n; i ++){
		p = (p * x[i]) % mod;
		ans = max(ans, (p * y[i]) % mod);
	}
	return ans;
}

int updateX(int pos, int val) {
	x[pos] = val;	
	int ans = 1, p = 1;
	for(int i = 0; i < (int)x.size(); i ++)
		p = (p * x[i]) % mod, ans = max(ans, (p * y[i]) % mod);
	return ans;
}

int updateY(int pos, int val) {
	y[pos] = val;
	int ans = 1, p = 1;
	for(int i = 0; i < (int)y.size(); i ++)
		p = (p * x[i]) % mod, ans = max(ans, (p * y[i]) % mod);
	return ans;
}

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