제출 #866314

#제출 시각아이디문제언어결과실행 시간메모리
866314JakobZorz말 (IOI15_horses)C++14
17 / 100
1541 ms10536 KiB
#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 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...