# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
571821 | beaconmc | 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>
#pragma GCC optimize("O3")
typedef long long ll;
#define ll int
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
#define double long double
#include "horses.h"
using namespace std;
vector<ll> x, y;
ll n;
int init(int N, int X[], int Y[]) {
n = N;
x.push_back(X[0]);
y.push_back(Y[0]);
FOR(i,1,N){
x.push_back(x[i-1] * X[i]);
y.push_back(Y[i]);
}
ll maxi = -1;
FOR(i,0,N){
maxi = max(maxi, X[i] * Y[i]);
}
return maxi;
}
int updateX(int pos, int val) {
x[pos] = val;
FOR(i,pos+1,n){
x[i] *= x[i-1];
}
ll maxi = -1;
FOR(i,0 n){
maxi = max(maxi, X[i] * Y[i]);
}
return maxi;
}
int updateY(int pos, int val) {
y[pos] = val;
ll maxi = -1;
FOR(i,0 n){
maxi = max(maxi, X[i] * Y[i]);
}
return maxi;
}