# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
672324 | Trisanu_Das | Horses (IOI15_horses) | C++17 | 25 ms | 18352 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>
using namespace std;
#define MOD 1000000007
#define ll long long
int n, x[500001], y[500001];
int solve(){
ll pref = 1, hrspr = 1, last = 0, ans = 0;
for(int i = 0; i < n; i++){
hrspr *= x[i];
pref = pref * x[i] % MOD;
if((long double)y[i] * hrspr > last){
ans = pref * y[i] % MOD; hrspr = 1; last = y[i];
}
}
return ans;
}
int init(int N, int X[], int Y[]){
n = N;
for(int i = 0; i < N; i++) x[i] = X[i], y[i] = Y[i];
return solve();
}
int updateX(int pos, int val){
x[pos] = val; solve();
}
int updateY(int pos, int val){
y[pos] = val; solve();
}
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... |