# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1053815 | XJP12 | Horses (IOI15_horses) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "horses.h"
using namespace std;
typedef vector<int> vi;
vi x,y;
int init(int n, int X[], int Y[]){
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]);
}
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]);
}
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]);
}
return maxi;
}