Submission #234205

#TimeUsernameProblemLanguageResultExecution timeMemory
234205pere_gilHorses (IOI15_horses)C++14
17 / 100
19 ms8436 KiB
#include <iostream>
#include "horses.h"

using namespace std;
int moe=1000000007;
int ja[5000];
int x[5000];
int y[5000];
int n;
int big=0;

int init(int N, int X[], int Y[])
{
    /* por 17 pts
    int big=0;
    int ja[N];
    ja[0]=X[0];
    for(int i=1;i<N;i++){
        ja[i]=ja[i-1]*X[i];
    }
    for(int i=0;i<N;i++) big=max(big, ja[i]*Y[i]);
    return big;
    */
    for(int i=0;i<N;i++){
        x[i]=X[i];
        y[i]=Y[i];
    }
    n=N;
    ja[0]=x[0];

    for(int i=1;i<n;i++) ja[i]=x[i]*ja[i-1]%moe;
    for(int i=0;i<n;i++) big=max(big, (ja[i]*y[i])%moe);

    return big;
}

int updateX(int pos, int val){
    x[pos]=val;
    for(int i=pos;i<n;i++) ja[i]=x[i]*ja[i-1]%moe;  //actualisar;
    for(int i=pos;i<n;i++) big=max(big, (ja[i]*y[i])%moe);

    return -3;
}

int updateY(int pos, int val){
    y[pos]=val;
    for(int i=pos;i<n;i++) big=max(big, (ja[i]*y[i])%moe);

    return -3;
}
#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...