Submission #1325032

#	Time	Username	Problem	Language	Result	Execution time	Memory
1325032		farica	Horses (IOI15_horses)	C++20	17 / 100	16 ms	4340 KiB

horses

#include "horses.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;

const int MOD = 1e9 + 7;

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

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