Submission #1129504

#	Time	Username	Problem	Language	Result	Execution time	Memory
1129504		boris_7	Horses (IOI15_horses)	C++20	17 / 100	25 ms	4420 KiB

horses

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

int init(int N, int X[], int Y[]) {
	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) {
	return 0;
}

int updateY(int pos, int val) {
	return 0;
}

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