# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1088726 | gustavo_d | Horses (IOI15_horses) | C++17 | 26 ms | 34416 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;
typedef long long ll;
const int MAXN = 500000;
const ll MOD = 1e9+7;
int n;
vector<ll> x(MAXN), y(MAXN), qtd(MAXN);
int init(int N, int X[], int Y[]) {
n = N+1;
y[0] = 0; x[0] = 1;
for (int i=1; i<n; i++) x[i] = (ll)X[i-1];
for (int i=1; i<n; i++) y[i] = (ll)Y[i-1];
qtd[0] = 1;
int pt = 0; ll since = 1;
for (int i=1; i<n; i++) {
qtd[i] = (qtd[i-1] * x[i]) % MOD;
since *= x[i];
while (since * y[i] > y[pt]) {
since /= x[pt];
pt++;
}
}
ll mx = 0; int pt_mx = 0;
ll ac = 1;
for (; pt<n; pt++) {
if (ac * y[pt] >= mx) pt_mx = pt;
mx = max(mx, ac * y[pt]);
ac *= x[pt];
}
return (qtd[pt_mx] * y[pt_mx]) % MOD;
// int dp[n][MX_COW+1];
// for (int i=1; i<=MX_COW; i++) {
// dp[0][i] = -1e9;
// }
// dp[0][1] = 0;
// for (int i=1; i<n; i++) {
// for (int cow=0; cow<=MX_COW; cow++) {
// dp[i][cow] = -1e9;
// for (int v=0; v<=MX_COW; v++) {
// if ((cow+v)/x[i] > MX_COW) continue;
// if ((cow+v) % x[i] != 0) continue;
// dp[i][cow] = max(
// dp[i][cow],
// dp[i-1][(cow + v) / x[i]] + v * y[i]
// );
// }
// }
// }
// return dp[n-1][0];
}
int updateX(int pos, int val) {
x[pos+1] = val;
qtd[0] = 1;
int pt = 0; ll since = 1;
for (int i=1; i<n; i++) {
qtd[i] = (qtd[i-1] * x[i]) % MOD;
since *= x[i];
while (since * y[i] > y[pt]) {
since /= x[pt];
pt++;
}
}
ll mx = 0; int pt_mx = 0;
ll ac = 1;
for (; pt<n; pt++) {
if (ac * y[pt] >= mx) pt_mx = pt;
mx = max(mx, ac * y[pt]);
ac *= x[pt];
}
return (qtd[pt_mx] * y[pt_mx]) % MOD;
}
int updateY(int pos, int val) {
y[pos+1] = val;
qtd[0] = 1;
int pt = 0; ll since = 1;
for (int i=1; i<n; i++) {
qtd[i] = (qtd[i-1] * x[i]) % MOD;
since *= x[i];
while (since * y[i] > y[pt]) {
since /= x[pt];
pt++;
}
}
ll mx = 0; int pt_mx = 0;
ll ac = 1;
for (; pt<n; pt++) {
if (ac * y[pt] >= mx) pt_mx = pt;
mx = max(mx, ac * y[pt]);
ac *= x[pt];
}
return (qtd[pt_mx] * y[pt_mx]) % MOD;
}
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... |