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<iostream>
#include"horses.h"
using namespace std;
typedef long long ll;
typedef long double ld;
int n;
int x[500000];
int y[500000];
int calc(){
int curr=1;
int res=0;
for(int i=0;i<n;i++){
curr*=x[i];
res=max(res,curr*y[i]);
}
return res;
}
int init(int N,int X[],int Y[]){
n=N;
for(int i=0;i<n;i++){
x[i]=X[i];
y[i]=Y[i];
}
return calc();
}
int updateX(int pos,int val){
x[pos]=val;
return calc();
}
int updateY(int pos,int val){
y[pos]=val;
return calc();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |