Submission #1053819

#TimeUsernameProblemLanguageResultExecution timeMemory
1053819XJP12말 (IOI15_horses)C++14
17 / 100
1526 ms8732 KiB
#include <bits/stdc++.h>
#include "horses.h"
using namespace std;
typedef vector<int> vi;
vi x,y;
int mod=1e9+7;
int n;
int init(int N, int X[], int Y[]){
	n=N;
	int horse = 1;
	int maxi=0;
	for(int i=0; i<n; i++){
		x.push_back(X[i]);
		y.push_back(Y[i]);
	}
	for(int i=0; i<n; i++){
		horse*=x[i];
		maxi=max(maxi,horse*y[i]%mod);
	}
	return maxi;
}

int updateX(int pos, int val) {	
	x[pos]=val;
	int horse = 1;
	int maxi=0;
	for(int i=0; i<n; i++){
		horse*=x[i];
		maxi=max(maxi,horse*y[i]%mod);
	}
	return maxi;
}

int updateY(int pos, int val) {
	y[pos]=val;
	int horse = 1;
	int maxi=0;
	for(int i=0; i<n; i++){
		horse*=x[i];
		maxi=max(maxi,horse*y[i]%mod);
	}
	return maxi;
}
#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...