# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
754900 | APROHACK | Horses (IOI15_horses) | C++14 | 1561 ms | 16192 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 <bits/stdc++.h>
#include "horses.h"
#define ll long long
#define pb push_back
const int mod = 1e9+7;
using namespace std;
int n;
ll maxV = 0;
ll acum[500005];
vector<ll>x, y;
void updateRet(){
acum[0] = x[0];
for(int i = 1 ; i < n ; i ++){
acum[i] = acum[i-1] * x[i] % mod;
}
ll ans = acum[n-1] * y[n-1] % mod;
ll current = x[n-1]* y[n-1];
for(int i = n-2 ; i >= 0 ; i --){
if(current > 1e9){
maxV = ans;
return ;
}
if(current < y[i]){
ans = acum[i] * y[i] % mod;
current = x[i]*y[i] % mod;
}else{
current = current * x[i] % mod;
}
}
maxV = ans;
}
int init(int N, int X[], int Y[]) {
n = N;
for(int i = 0 ; i < N ; i++){
x.pb(X[i]);
y.pb(Y[i]);
}
updateRet();
return maxV%mod;
}
int updateX(int pos, int val) {
x[pos] = val;
updateRet();
return maxV%mod;
}
int updateY(int pos, int val) {
y[pos] = val;
updateRet();
return maxV%mod;
}
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... |