Submission #1185357

#	Time	Username	Problem	Language	Result	Execution time	Memory
1185357		mahmudow_mahmyt	Horses (IOI15_horses)	C++20	0 / 100	23 ms	16196 KiB

horses

#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define mxn 500002
#define pb push_back
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
using namespace std;
ll n,x[mxn],y[mxn],mod=1e9+7,p[mxn];
ll max_profit(){
	ll mx=0;
	for(int i=0;i<n;i++){
		ll c=(p[i]*y[i])%mod;
		if(c>mx){
			mx=c;
		}
	}
	return mx;
}
int init(int n, int X[], int Y[]){
	for(int i=0;i<n;i++){
		x[i]=X[i];
		y[i]=Y[i];
	}
	p[0]=x[0]%mod;
	for(int i=1;i<n;i++){
		p[i]=p[i-1]*x[i];
		p[i]%=mod;
	}
	return (int)max_profit();
}
int updateX(int pos, int val){
	x[pos]=val;
	return (int) max_profit();
}
int updateY(int pos, int val){
	y[pos]=val;
	return (int) max_profit();
}

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