# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
111376 | diamond_duke | Boat (APIO16_boat) | C++11 | 242 ms | 4472 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 <algorithm>
#include <cstring>
#include <cstdio>
using ll = long long;
constexpr int MOD = 1e9 + 7;
inline int quick_pow(int a, int n)
{
int res = 1;
while (n)
{
if (n & 1)
res = (ll)res * a % MOD;
a = (ll)a * a % MOD;
n >>= 1;
}
return res;
}
int lp[505], rp[505], app[205], dp[2][1005][505], inv[505];
int main()
{
// freopen("uoj-204.in", "r", stdin);
int n, cnt = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d%d", lp + i, rp + i);
app[cnt++] = lp[i];
app[cnt++] = ++rp[i];
}
std::sort(app, app + cnt);
cnt = std::unique(app, app + cnt) - app;
for (int i = 0; i < n; i++)
{
lp[i] = std::lower_bound(app, app + cnt, lp[i]) - app;
rp[i] = std::lower_bound(app, app + cnt, rp[i]) - app;
}
inv[0] = inv[1] = 1;
for (int i = 2; i <= n; i++)
inv[i] = (ll)(MOD - MOD / i) * inv[MOD % i] % MOD;
dp[0][0][0] = 1;
for (int i = 0; i < n; i++)
{
auto cur = dp[i & 1], nxt = dp[i & 1 ^ 1];
memcpy(nxt, cur, sizeof(dp[i & 1]));
for (int j = 0; j < cnt; j++)
{
for (int k = 0; k <= i; k++)
{
if (!cur[j][k])
continue;
for (int x = std::max(j, lp[i]); x < rp[i]; x++)
{
int t = (x == j) * k + 1, len = app[x + 1] - app[x];
nxt[x][t] = (nxt[x][t] + (ll)cur[j][k] * (len - t + 1) % MOD * inv[t]) % MOD;
}
}
}
}
int ans = 0;
for (int i = 0; i < cnt; i++)
{
for (int j = 0; j <= n; j++)
ans = (ans + dp[n & 1][i][j]) % MOD;
}
printf("%d\n", (ans + MOD - 1) % MOD);
return 0;
}
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... |