Submission #999521

#TimeUsernameProblemLanguageResultExecution timeMemory
999521AlfraganusHorses (IOI15_horses)C++17
17 / 100
1547 ms11468 KiB
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;

const int mod = 1e9 + 7;
vector<int> x, y;

int init(int n, int X[], int Y[]) {
	for(int i = 0; i < n; i ++)
		x.push_back(X[i]);
	for(int i = 0; i < n; i ++)
		y.push_back(Y[i]);
	int ans = 1, p = 1;
	for(int i = 0; i < n; i ++){
		p = (p * x[i]) % mod;
		ans = max(ans, (p * y[i]) % mod);
	}
	return ans;
}

int updateX(int pos, int val) {
	x[pos] = val;	
	int ans = 1, p = 1;
	for(int i = 0; i < (int)x.size(); i ++)
		p = (p * x[i]) % mod, ans = max(ans, (p * y[i]) % mod);
	return ans;
}

int updateY(int pos, int val) {
	y[pos] = val;
	int ans = 1, p = 1;
	for(int i = 0; i < (int)y.size(); i ++)
		p = (p * x[i]) % mod, ans = max(ans, (p * 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...