# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1117066 | Zflop | Horses (IOI15_horses) | C++14 | 1568 ms | 8544 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.
#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;
int y_ans = Y[0];
int i_ans = 0;
int x = X[0];
for (int i = 1; i < N;++i) {
x = x * X[i] % MOD;
int x_cur = 1;
bool ok = false;
for (int j = i_ans + 1; j <= i;++j) {
x_cur = x_cur * X[i];
if (x_cur > MOD) {
ok = true;
}
x_cur %= MOD;
}
if (x_cur * Y[i] > y_ans)
ok = true;
if (ok) {
y_ans = Y[i];
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);
}
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... |