Submission #1233595

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233595		12baater	Horses (IOI15_horses)	C++20	17 / 100	15 ms	4420 KiB

horses

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

using namespace std;
typedef long long ll;

const ll MOD = 1E9 + 7;


int init(int N, int X[], int Y[]) {
    ll horses = 1;
    ll profit = 0;
    for (int i = 0; i < N; i++) {
        horses *= X[i];
        profit = max(profit, horses*Y[i] % MOD);
    }
	return static_cast<int>(profit);
}

int updateX(int pos, int val) {	
	return 0;
}

int updateY(int pos, int val) {
	return 0;
}

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