# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1117265 | Zflop | Horses (IOI15_horses) | C++14 | 0 ms | 0 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;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define ll long long
const int NMAX = (int)1e5 * 6;
const ll MOD = (int)1e9 + 7;
int A[NMAX],B[NMAX],n;
ll POW(ll x,int p) {
ll res = 1;
while (p) {
if (p % 2)
res = res * x % MOD;
p /= 2;
x = x * x % MOD;
}
return res;
}
int init(int N, int X[], int Y[]) {
for (int i = 0; i < N;++i) {
A[i] = X[i];
B[i] = Y[i];
}
n = N;
ll ans = X[0] * Y[0] % MOD;
ll x = X[0];
int ans_i = 0;
for (int i = min(1,N - 40); i < N;++i) {
x = x * X[i];
if (Y[ans_i] < x || x * Y[i] > Y[ans_i]) {
x = 1;
i_ans = i;
ans = x * Y[i] % MOD;
}
}
return ans;
}
int updateX(int pos, int val) {
A[pos] = val;
return init(n,A,B);
}
int updateY(int pos, int val) {
B[pos] = val;
return init(n,A,B);
}