Submission #1011336

#TimeUsernameProblemLanguageResultExecution timeMemory
1011336nisanduuHorses (IOI15_horses)C++14
17 / 100
12 ms10584 KiB
/******************************************************************************

                              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 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;
    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;
    return 0;
}
int updateY(int pos,int val){
    b[pos]=val;
    return 0;
}

#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...