Submission #1240956

#	Time	Username	Problem	Language	Result	Execution time	Memory
1240956		edga1	말 (IOI15_horses)	C++20	17 / 100	1593 ms	8248 KiB

horses

#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7, N=5e5+5;
int x[N], y[N],gn;

int calculate(){
    int m=0;
	for(int i=gn-1; i>=0; i--){
        m=max(1ll*m*x[i]%MOD,1ll*x[i]*y[i]%MOD);
	}
	return m;
}

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

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

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

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