Submission #1004822

#	Time	Username	Problem	Language	Result	Execution time	Memory
1004822		magikarp23	Horses (IOI15_horses)	C++17	17 / 100	1586 ms	8260 KiB

horses

#include <bits/stdc++.h>
#include "horses.h"
using namespace std;

const int MAX_N = 500000 + 1;
int MOD = 1000000000 + 7;
int X_store[MAX_N];
int Y_store[MAX_N];
int N_store;

int calc_max_profit() {
	long long  max_profit = 1;
	long long num_horses = 1;
	for (int i=0; i<N_store; i++) {
		num_horses *= X_store[i];
		max_profit = max(max_profit, (num_horses * Y_store[i]) % MOD);
	}

	return int (max_profit % MOD);	
}

int init(int N, int X[], int Y[]) {
	N_store = N;
	for (int i=0; i<N; i++) {
		X_store[i] = X[i];
		Y_store[i] = Y[i];
	}
	return calc_max_profit();	
}

int updateX(int pos, int val) {	
	X_store[pos] = val;
	return calc_max_profit();
}

int updateY(int pos, int val) {
	Y_store[pos] = val;
	return calc_max_profit();	
}

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