# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1011278 | Mardonbekhazratov | Horses (IOI15_horses) | C++17 | 1551 ms | 26304 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "horses.h"
#include<algorithm>
#include<vector>
#include<iostream>
const __int128_t INFLL=1e18;
const int INF=1e9;
const int MOD=1e9+7;
using namespace std;
int n;
vector<int>x,y;
int get(){
vector<__int128_t>pref(n+1),suff(n+2);
pref[0]=suff[n+1]=1;
for(int i=0;i<n;i++){
pref[i+1]=pref[i]*x[i]%MOD;
suff[n-i]=max(suff[n-i+1]*x[n-i-1],suff[n+1]*x[n-i-1]*y[n-i-1]);
if(suff[n-i]>=INFLL){
long long ans=suff[n-i]%MOD;
for(int j=i-1;j>=0;j--) ans=ans*x[j]%MOD;
return ans;
}
}
return suff[1]%MOD;
}
int init(int N, int X[], int Y[]) {
n=N;
x.resize(n);
y.resize(n);
for(int i=0;i<n;i++) x[i]=X[i],y[i]=Y[i];
return get();
}
int updateX(int pos, int val) {
x[pos]=val;
return get();
}
int updateY(int pos, int val) {
y[pos]=val;
return get();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |