#include<bits/stdc++.h>
#include "horses.h"
using namespace std;
int init(int N, int X[], int Y[]) {
int P[N];
P[0] = X[0];
for(int i = 1;i < N;i ++){
P[i] = P[i - 1] * X[i];
}
int mx = 0;
int g[N];
memset(g , 0 , sizeof(g));
for(int i = N - 1;i >= 0;i --){
if(P[i] * Y[i] > mx){
mx = P[i] * Y[i];
g[i] = 1;
}
}
int V = 1 , ans = 0 , sum = 0;
for(int i = 0;i < N;i ++){
V *= X[i];
if(g[i]){
ans = max(ans , sum + V * Y[i]);
sum += (V - 1) * Y[i];
V = 1;
}
}
return ans;
}
int updateX(int pos, int val) {
return 0;
}
int updateY(int pos, int val) {
return 0;
}
# | 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... |