Submission #1129514

#	Time	Username	Problem	Language	Result	Execution time	Memory
1129514		boris_7	Horses (IOI15_horses)	C++20	0 / 100	1595 ms	9140 KiB

horses

#include "horses.h"
#include<bits/stdc++.h>
int mod = 1e9+7;
using namespace std;
using ll = long long;

vector<int>x,y;
int n;

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

		ll ans = 1,cnt=1,ind = n-31;
		for(int i = n-30;i<n;i++){
			cnt*=x[i];
			if(cnt*y[i]>=y[ind]) ind = i,cnt=1;
		}
		for(int i = 0;i<=ind;i++) ans=(ans*x[i])%mod;
		ans*=y[ind];
		return ans%mod;
	
}

int updateX(int pos, int val) {
	x[pos]=val;
	ll ans = 1,cnt=1,ind = n-31;
		for(int i = n-30;i<n;i++){
			cnt*=x[i];
			if(cnt*y[i]>=y[ind]) ind = i,cnt=1;
		}
		for(int i = 0;i<=ind;i++) ans=(ans*x[i])%mod;
		ans*=y[ind];
		return ans%mod;
}

int updateY(int pos, int val) {
	y[pos]=val;
	ll ans = 1,cnt=1,ind = n-31;
		for(int i = n-30;i<n;i++){
			cnt*=x[i];
			if(cnt*y[i]>=y[ind]) ind = i,cnt=1;
		}
		for(int i = 0;i<=ind;i++) ans=(ans*x[i])%mod;
		ans*=y[ind];
		return ans%mod;
}

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