제출 #793767

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
793767		PixelCat	말 (IOI15_horses)	C++14	17 / 100	1571 ms	12056 KiB

horses

#ifdef NYAOWO
#include "grader.cpp"
#endif

#include "horses.h"

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
#define int LL
#define MOD (int)(1'000'000'007)
using namespace std;
using LL = long long;
using pii = pair<int, int>;

const int MAXN = 500'000;

int n;
int x[MAXN + 10];
int y[MAXN + 10];

int32_t solve() {
	int mx = 0;
	int cur = 1;
	For(i, 0, n - 1) {
		cur *= x[i];
		mx = max(mx, cur * y[i]);
	}
	return (int32_t)(mx % MOD);
}

int32_t init(int32_t N, int32_t X[], int32_t Y[]) {
	n = N;
	For(i, 0, n - 1) x[i] = X[i];
	For(i, 0, n - 1) y[i] = Y[i];
	return solve();
}

int32_t updateX(int32_t pos, int32_t val) {	
	x[pos] = val;
	return solve();
}

int32_t updateY(int32_t pos, int32_t val) {
	y[pos] = val;
	return solve();
}

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