Submission #310053

#TimeUsernameProblemLanguageResultExecution timeMemory
310053amunduzbaevHorses (IOI15_horses)C++14
17 / 100
1586 ms8320 KiB
#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
const int N=5e5+5;
int n,a[N],b[N];
int init(int s, int x[], int y[]) {
    n=s;
    int ans=1,mx=0;
    for(int i=0;i<n;i++){
        a[i]=x[i];
        b[i]=y[i];
        ans*=x[i];
        mx=max(ans*y[i],mx);
    }
	return mx;
}

int updateX(int pos, int val) {
    a[pos]=val;
    int ans=1,mx=0;
    for(int i=0;i<n;i++){
        ans*=a[i];
        mx=max(ans*b[i],mx);
    }
	return mx;
}

int updateY(int pos, int val) {
    b[pos]=val;
    int ans=1,mx=0;
    for(int i=0;i<n;i++){
        ans*=a[i];
        mx=max(ans*b[i],mx);
    }
	return mx;
}
#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...