Submission #136026

#	Time	Username	Problem	Language	Result	Execution time	Memory
136026		amiratou	말 (IOI15_horses)	C++14	17 / 100	1588 ms	10360 KiB

horses

#pragma GCC optimize("O3")
#include "horses.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MOD = (int)(1e9)+7;
int x[500005],y[500005],n;
ll solve(){
	ll nb=1,ans=0;
	for (int i = 0; i < n; ++i)
	{
		nb=((nb%MOD)*(x[i]%MOD))%MOD;
		ans=max(ans,((nb%MOD)*(y[i]%MOD))%MOD);
	}
	return ans%MOD;
}

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

int updateX(int pos, int val) {
	x[pos]=val;
	return (int)solve();
}

int updateY(int pos, int val) {
	y[pos]=val;
	return (int)solve();
}

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