Submission #1011343

#	Time	Username	Problem	Language	Result	Execution time	Memory
1011343		sadeep	Horses (IOI15_horses)	C++17	17 / 100	11 ms	10564 KiB

horses

#include "horses.h"


int n;
int _Y[1002];
int _X[1002];
int MOD = 1000000000+7;

int max(int a,int b) { if (a>b) return a; return b; }

int run(){
    int t = 1;
    int mx=0;
    for(int i=0; i<n; i++){
        t=((t%MOD)*(_X[i]%MOD)%MOD);
        mx = max(mx, (t*(_Y[i]%MOD))%MOD);
    }
    return mx;
}

int init(int N, int X[], int Y[]) {
    n = N;
    for(int i=0; i <N;i++)_X[i] = X[i];
    for(int i=0; i <N;i++)_Y[i] = Y[i];
    return run();
}

int updateX(int pos, int val) {
    _X[pos]=val;
    return run();
}

int updateY(int pos, int val) {
    _Y[pos]=val;
    return run();
}

• Subtask 1: 17 / 17
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 23
• Subtask 5: 0 / 23