제출 #1281466

#제출 시각아이디문제언어결과실행 시간메모리
1281466nathlol2말 (IOI15_horses)C++20
17 / 100
1595 ms12168 KiB
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 5e5 + 5;
const ll MOD = 1e9 + 7;
vector<ll> x(N), y(N);
int n;
int init(int NN, int X[], int Y[]) {
	n = NN;
	for(int i = 0;i<n;i++) x[i] = X[i], y[i] = Y[i];
	ll ans = 0, mul = 1;
	for(int i = 0;i<n;i++){
		mul *= x[i];
		mul %= MOD;
		ans = max(ans, (mul * y[i]) % MOD);
	}
	return ans;
}

int updateX(int pos, int val) {
	x[pos] = val;
	ll ans = 0, mul = 1;
	for(int i = 0;i<n;i++){
		mul *= x[i];
		mul %= MOD;
		ans = max(ans, (mul * y[i]) % MOD);
	}
	return ans;
}

int updateY(int pos, int val) {
	y[pos] = val;
	ll ans = 0, mul = 1;
	for(int i = 0;i<n;i++){
		mul *= x[i];
		mul %= MOD;
		ans = max(ans, (mul * y[i]) % MOD);
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...