Submission #1270054

#	Time	Username	Problem	Language	Result	Execution time	Memory
1270054		scalifrastico_098	Horses (IOI15_horses)	C++20	0 / 100	1594 ms	8260 KiB

horses

#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> gh, fg; long long u, l=1, mod=1e9+7;
int init(int n, int x[], int y[]) {
	gh.resize(n); fg.resize(n); for(long long i=0; i<n; i++) gh[i]=x[i]; for(long long i=0; i<n; i++) fg[i]=y[i];
	long long k=0; u=n; 
	for(long long i=0; i<n; i++){l*=gh[i]%mod; if(k>l*fg[i]){k=l*fg[i]%mod;}}
	return k%mod;
}
int updateX(int pos, int val) {	
	gh[pos]=val; long long hjg=0, kj=1;
	for(long long i=0; i<u; i++){kj*=gh[i]%mod; if(hjg>kj*fg[i]){hjg=kj*fg[i]%mod;} }
	return hjg%mod;
}
int updateY(int pos, int val) {
	fg[pos]=val; long long jh=0, ghj=1; 
	for(long long i=0; i<u; i++){ghj*=gh[i]%mod; if(jh>ghj*fg[i]){jh=ghj*fg[i]%mod;}}
	return jh%mod;
}

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