| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 620743 | Hazem | Horses (IOI15_horses) | C++14 | 100 ms | 20644 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>
#define LL long long
using namespace std;
const int M = 5e5+10;
const int MOD = 1e9+7;
LL add(LL a,LL b){
return (a+b)%MOD;
}
LL mult(LL a,LL b){
return (a*b)%MOD;
}
LL fastpow(LL n,LL k){
LL ret = 1;
while(k){
if(k&1)ret = mult(ret,n);
k /= 2;
n = mult(n,n);
}
return ret;
}
LL divide(LL a,LL b){
return mult(a,fastpow(b,MOD-2));
}
LL a[M],b[M],n;
LL pr = 1;
LL calc(){
LL idx = max(1ll,n-30),cur = 1;
for(int i=idx+1;i<=n;i++){
if((cur*a[i]>b[idx])||(cur*a[i]*b[i]>b[idx]))
idx = i,cur = 1;
else
cur *= a[i];
}
cur = 1;
for(int i=max(1ll,n-30);i<=idx;i++)
cur = mult(cur,a[i]);
return mult(mult(cur,pr),b[idx]);
}
int init(int N, int X[], int Y[]) {
n = N;
a[0] = 1;
for(int i=1;i<=n;i++){
a[i] = X[i-1];
b[i] = Y[i-1];
if(i<n-30)
pr = mult(pr,a[i]);
}
return calc();
}
int updateX(int pos, int val) {
if(pos+1<n-30){
pr = divide(pr,a[pos+1]);
pr = mult(pr,val);
}
a[pos+1] = val;
return calc();
}
int updateY(int pos, int val) {
b[pos+1] = val;
return calc();
}
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... | ||||
