Submission #1129510

#	Time	Username	Problem	Language	Result	Execution time	Memory
1129510		boris_7	Horses (IOI15_horses)	C++20	34 / 100	1596 ms	9144 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]);

	if(n<=1000){
		ll ans = 1,cnt=1,ind = 0;
		for(int i = 0;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;
	}
	else{
		ll ans = 1,cnt=1,ind = 0;
		for(int i = 0;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;
	if(n<=1000){
		ll ans = 1,cnt=1,ind = 0;
		for(int i = 0;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;
	}
	else{
		ll ans = 1,cnt=1,ind = n-41;
		for(int i = n-40;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;
	if(n<=1000){
		ll ans = 1,cnt=1,ind = 0;
		for(int i = 0;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;
	}
	else{
		ll ans = 1,cnt=1,ind = n-41;
		for(int i = n-40;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: 17 / 17
• Subtask 2: 17 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 23
• Subtask 5: 0 / 23