Submission #137302

#TimeUsernameProblemLanguageResultExecution timeMemory
137302eohomegrownappsHorses (IOI15_horses)C++14
0 / 100
1559 ms10520 KiB
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> x;
vector<int> y;
int n;
int init(int N, int X[], int Y[]) {
	n=N;
	x.resize(n);
	y.resize(n);
	for (int i = 0; i<n; i++){
		x[i]=X[i];
		y[i]=Y[i];
	}
	return 0;
}

int query(){
	int mx = 1;
	int current = 1;
	for (int i = 0; i<n; i++){
		current*=x[i];
		mx=max(mx,current*y[i]);
	}
	return mx;
}

int updateX(int pos, int val) {
	x[pos]=val;
	return query();
}

int updateY(int pos, int val) {
	y[pos]=val;
	return query();
}
#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...