# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
316190 | mohamedsobhi777 | 말 (IOI15_horses) | C++14 | 24 ms | 16888 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"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int _N = 2e5 + 7, mod = 1e9 + 7;
const ll inf = 2e18;
int n, m;
ll X[_N], Y[_N];
ll mul(ll x, ll y)
{
return 1ll * x * y % mod;
}
ll eval(int x)
{
ll ret = 1ll;
for (int i = 0; i <= x; ++i)
{
ret = mul(ret, X[i]);
}
return ret;
}
ll add(ll x, ll y)
{
return (x + y >= mod ? x + y - mod : x + y);
}
ll solve()
{
ll ret = 1ll;
ll suf = 1ll;
int i = n - 1;
int cnt = 0;
for (; ~i; --i)
{
suf = 1ll * suf * X[i];
cnt += (X[i] > 1);
if (cnt > 30 || suf > 1e9)
break;
}
ret = eval(i - 1);
ll all = 1ll;
ll Max = 1ll;
for (i++; i < n; ++i)
{
// cout << i << " " << all << " " << Y[i] << "*\n";
all *= X[i];
Max = max(Max, 1ll * all * Y[i]);
}
//cout << "\n";
return mul(ret, Max);
}
int init(int N, int _X[], int _Y[])
{
n = N;
for (int i = 0; i < N; ++i)
{
X[i] = _X[i];
Y[i] = _Y[i];
}
return solve();
}
int updateX(int pos, int val)
{
X[pos] = val;
return solve();
}
int updateY(int pos, int val)
{
Y[pos] = val;
return solve();
}
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... |