제출 #353680

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
353680		antontsiorvas	말 (IOI15_horses)	C++14	17 / 100	1591 ms	8192 KiB

horses

#include "horses.h"
#include <algorithm>

int n, x[500005], y[500005];

int init(int N, int X[], int Y[]) {
	for(int i=0; i<N; i++){
		x[i] = X[i];
		y[i] = Y[i];
	}
	n = N;
	int horses=1, ret=0;
	for(int i=0; i<N; i++){
		horses *= x[i];
		ret %= 1000000007;
		horses %= 1000000007;
		ret = std::max(ret, (horses*y[i])%1000000007);
	}
	return ret;
}

int updateX(int pos, int val) {	
	x[pos] = val;
	int horses=1, ret=0;
	for(int i=0; i<n; i++){
		horses *= x[i];
		ret %= 1000000007;
		horses %= 1000000007;
		ret = std::max(ret, (horses*y[i])%1000000007);
	}
	return ret;
}

int updateY(int pos, int val) {
	y[pos] = val;
	int horses=1, ret=0;
	for(int i=0; i<n; i++){
		horses *= x[i];
		ret %= 1000000007;
		horses %= 1000000007;
		ret = std::max(ret, (horses*y[i])%1000000007);
	}
	return ret;
}

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