Submission #1011338

#	Time	Username	Problem	Language	Result	Execution time	Memory
1011338		nisanduu	Horses (IOI15_horses)	C++14	17 / 100	12 ms	9820 KiB

horses

/******************************************************************************

                              Online C++ Compiler.
               Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.

*******************************************************************************/

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e4;
int sz;
int a[N],b[N];
ll mod = 1e9 + 7;
int init(int n,int* X,int* Y){
    for(int i=0;i<n;i++) {
        a[i]=X[i];
        b[i]=Y[i];
    }
    // a=X;
    // b=Y;
    // N=n;
    sz=n;
    ll ans = 0;
    ll cr = 1;
    for(int i=0;i<n;i++){
        cr = (cr*1LL*a[i])%mod;
        ans = max(ans,(cr*b[i]*1LL)%mod);
    }
    return (int)ans;
}
int updateX(int pos,int val){
    a[pos]=val;
    ll ans = 0;
    ll cr = 1;
    for(int i=0;i<sz;i++){
        cr = (cr*1LL*a[i])%mod;
        ans = max(ans,(cr*b[i]*1LL)%mod);
    }
    return (int)ans;
}
int updateY(int pos,int val){
    b[pos]=val;
    ll ans = 0;
    ll cr = 1;
    for(int i=0;i<sz;i++){
        cr = (cr*1LL*a[i])%mod;
        ans = max(ans,(cr*b[i]*1LL)%mod);
    }
    return (int)ans;
}

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