#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int n;
vector<ll> C, P;
ll preprod = 1;
ll fp(ll x, ll y){
ll res=1;
while(y){
if(y%2LL)res*=x;
res%=mod;
x*=x;
x%=mod;
y/=2LL;
}
return res;
}
ll inv(ll x){return fp(x,mod-2LL);}
int solve() {
ll prod = C[n - 1];
int best = n - 1;
long double ldprod = (long double)C[n-1];
for(int i = n - 2; i >= 0; --i) {
prod *= C[i];
ldprod *= C[i];
long double x = ldprod * (long double)P[best];
if(x >= 1.5e18) break;
if(prod * P[best] <= C[i] * P[i]) {
best = i;
prod = C[i];
ldprod = (long double)C[i];
}
}
prod = 1;
if(n > 1000) {
if(best < n - 100) exit(1);
prod = preprod;
for(int i = n - 100; i <= best; ++i)
prod = (prod * C[i]) % mod;
prod = (prod * P[best]) % mod;
return int(prod % mod);
}
for(int i = 0; i <= best; ++i) {
prod *= C[i];
prod %= mod;
}
prod *= P[best];
prod %= mod;
return int(prod % mod);
}
int init(int N, int X[], int Y[]) {
n = N;
C.resize(n);
P.resize(n);
for(int i = 0; i < n; ++i) C[i] = X[i];
for(int i = 0; i < n; ++i) P[i] = Y[i];
if(n > 1000) {
preprod = 1;
for(int i = 0; i < n - 100; ++i) {
preprod *= C[i];
preprod %= mod;
}
}
return solve();
}
int updateX(int pos, int val) {
if(n > 1000 && pos < n - 100) {
preprod *= inv(C[pos]);
preprod %= mod;
preprod *= (ll)val;
preprod %= mod;
}
C[pos] = val;
return solve();
}
int updateY(int pos, int val) {
P[pos] = val;
return solve();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
256 KB |
Output is correct |
3 |
Correct |
4 ms |
256 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
5 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
10 |
Correct |
6 ms |
256 KB |
Output is correct |
11 |
Correct |
4 ms |
384 KB |
Output is correct |
12 |
Correct |
4 ms |
256 KB |
Output is correct |
13 |
Correct |
4 ms |
256 KB |
Output is correct |
14 |
Correct |
5 ms |
256 KB |
Output is correct |
15 |
Correct |
4 ms |
256 KB |
Output is correct |
16 |
Correct |
4 ms |
384 KB |
Output is correct |
17 |
Correct |
5 ms |
384 KB |
Output is correct |
18 |
Correct |
4 ms |
256 KB |
Output is correct |
19 |
Correct |
4 ms |
256 KB |
Output is correct |
20 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Correct |
4 ms |
256 KB |
Output is correct |
3 |
Correct |
5 ms |
256 KB |
Output is correct |
4 |
Correct |
4 ms |
256 KB |
Output is correct |
5 |
Correct |
4 ms |
256 KB |
Output is correct |
6 |
Correct |
4 ms |
256 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
4 ms |
256 KB |
Output is correct |
9 |
Correct |
4 ms |
384 KB |
Output is correct |
10 |
Correct |
5 ms |
384 KB |
Output is correct |
11 |
Correct |
4 ms |
304 KB |
Output is correct |
12 |
Correct |
4 ms |
256 KB |
Output is correct |
13 |
Correct |
4 ms |
256 KB |
Output is correct |
14 |
Correct |
4 ms |
256 KB |
Output is correct |
15 |
Correct |
5 ms |
256 KB |
Output is correct |
16 |
Correct |
4 ms |
256 KB |
Output is correct |
17 |
Correct |
5 ms |
256 KB |
Output is correct |
18 |
Correct |
4 ms |
256 KB |
Output is correct |
19 |
Correct |
4 ms |
384 KB |
Output is correct |
20 |
Correct |
5 ms |
256 KB |
Output is correct |
21 |
Correct |
5 ms |
256 KB |
Output is correct |
22 |
Correct |
4 ms |
256 KB |
Output is correct |
23 |
Correct |
10 ms |
384 KB |
Output is correct |
24 |
Correct |
10 ms |
384 KB |
Output is correct |
25 |
Correct |
10 ms |
308 KB |
Output is correct |
26 |
Correct |
10 ms |
384 KB |
Output is correct |
27 |
Correct |
13 ms |
384 KB |
Output is correct |
28 |
Correct |
10 ms |
384 KB |
Output is correct |
29 |
Correct |
14 ms |
384 KB |
Output is correct |
30 |
Correct |
10 ms |
384 KB |
Output is correct |
31 |
Correct |
12 ms |
384 KB |
Output is correct |
32 |
Correct |
13 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
115 ms |
13048 KB |
Output is correct |
2 |
Correct |
144 ms |
13176 KB |
Output is correct |
3 |
Correct |
113 ms |
16888 KB |
Output is correct |
4 |
Correct |
138 ms |
20728 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
256 KB |
Output is correct |
4 |
Correct |
4 ms |
256 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
4 ms |
384 KB |
Output is correct |
7 |
Correct |
4 ms |
256 KB |
Output is correct |
8 |
Correct |
4 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
256 KB |
Output is correct |
10 |
Correct |
5 ms |
384 KB |
Output is correct |
11 |
Correct |
5 ms |
256 KB |
Output is correct |
12 |
Correct |
4 ms |
256 KB |
Output is correct |
13 |
Correct |
5 ms |
384 KB |
Output is correct |
14 |
Correct |
4 ms |
384 KB |
Output is correct |
15 |
Correct |
5 ms |
256 KB |
Output is correct |
16 |
Correct |
4 ms |
384 KB |
Output is correct |
17 |
Correct |
4 ms |
384 KB |
Output is correct |
18 |
Correct |
5 ms |
384 KB |
Output is correct |
19 |
Correct |
5 ms |
256 KB |
Output is correct |
20 |
Correct |
5 ms |
256 KB |
Output is correct |
21 |
Correct |
5 ms |
256 KB |
Output is correct |
22 |
Correct |
5 ms |
384 KB |
Output is correct |
23 |
Correct |
10 ms |
384 KB |
Output is correct |
24 |
Correct |
10 ms |
384 KB |
Output is correct |
25 |
Correct |
10 ms |
384 KB |
Output is correct |
26 |
Correct |
10 ms |
432 KB |
Output is correct |
27 |
Correct |
13 ms |
384 KB |
Output is correct |
28 |
Correct |
10 ms |
384 KB |
Output is correct |
29 |
Correct |
14 ms |
384 KB |
Output is correct |
30 |
Correct |
10 ms |
384 KB |
Output is correct |
31 |
Correct |
12 ms |
384 KB |
Output is correct |
32 |
Correct |
14 ms |
384 KB |
Output is correct |
33 |
Runtime error |
33 ms |
12032 KB |
Execution failed because the return code was nonzero |
34 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
4 ms |
256 KB |
Output is correct |
4 |
Correct |
4 ms |
256 KB |
Output is correct |
5 |
Correct |
4 ms |
256 KB |
Output is correct |
6 |
Correct |
5 ms |
256 KB |
Output is correct |
7 |
Correct |
4 ms |
256 KB |
Output is correct |
8 |
Correct |
4 ms |
384 KB |
Output is correct |
9 |
Correct |
4 ms |
384 KB |
Output is correct |
10 |
Correct |
4 ms |
256 KB |
Output is correct |
11 |
Correct |
4 ms |
256 KB |
Output is correct |
12 |
Correct |
5 ms |
256 KB |
Output is correct |
13 |
Correct |
4 ms |
256 KB |
Output is correct |
14 |
Correct |
4 ms |
256 KB |
Output is correct |
15 |
Correct |
4 ms |
384 KB |
Output is correct |
16 |
Correct |
5 ms |
256 KB |
Output is correct |
17 |
Correct |
4 ms |
256 KB |
Output is correct |
18 |
Correct |
4 ms |
256 KB |
Output is correct |
19 |
Correct |
4 ms |
256 KB |
Output is correct |
20 |
Correct |
4 ms |
256 KB |
Output is correct |
21 |
Correct |
4 ms |
256 KB |
Output is correct |
22 |
Correct |
5 ms |
256 KB |
Output is correct |
23 |
Correct |
11 ms |
384 KB |
Output is correct |
24 |
Correct |
10 ms |
384 KB |
Output is correct |
25 |
Correct |
10 ms |
384 KB |
Output is correct |
26 |
Correct |
10 ms |
384 KB |
Output is correct |
27 |
Correct |
13 ms |
384 KB |
Output is correct |
28 |
Correct |
10 ms |
384 KB |
Output is correct |
29 |
Correct |
14 ms |
384 KB |
Output is correct |
30 |
Correct |
10 ms |
384 KB |
Output is correct |
31 |
Correct |
12 ms |
384 KB |
Output is correct |
32 |
Correct |
13 ms |
384 KB |
Output is correct |
33 |
Correct |
116 ms |
13052 KB |
Output is correct |
34 |
Correct |
143 ms |
13048 KB |
Output is correct |
35 |
Correct |
113 ms |
16888 KB |
Output is correct |
36 |
Correct |
139 ms |
20732 KB |
Output is correct |
37 |
Runtime error |
35 ms |
16000 KB |
Execution failed because the return code was nonzero |
38 |
Halted |
0 ms |
0 KB |
- |