# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1107615 | Aviansh | Horses (IOI15_horses) | C++17 | 1567 ms | 8016 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"
int n;
int *x;
int *y;
int mod = 1e9+7;
int finans(){
int mx = 0;
long long curr = 1;
for(int i = 0;i<n;i++){
curr*=x[i];
if(curr>y[mx]){
mx=i;
curr=1;
continue;
}
else if(curr*y[i]>y[mx]){
mx=i;
curr=1;
continue;
}
}
long long ans = 1;
for(int i = 0;i<=mx;i++){
ans*=x[i];
ans%=mod;
}
ans*=y[mx];
ans%=mod;
return ans;
}
int init(int N, int X[], int Y[]) {
x=X;
y=Y;
n=N;
return finans();
}
int updateX(int pos, int val) {
x[pos]=val;
return finans();
}
int updateY(int pos, int val) {
y[pos]=val;
return finans();
}
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... |