# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41678 | gabrielsimoes | Boat (APIO16_boat) | C++14 | 67 ms | 1076 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;
typedef long long ll;
const ll MOD = 1'000'000'007;
inline ll mod(ll a) { return a %= MOD, a < 0 ? a + MOD : a; }
int main() {
int n;
scanf("%d", &n);
vector<int> limits;
int va[n + 1], vb[n + 1];
for (int i = 1; i <= n; i++) {
scanf("%d %d", &va[i], &vb[i]);
vb[i]++;
limits.push_back(va[i]);
limits.push_back(vb[i]);
}
sort(limits.begin(), limits.end());
limits.resize(unique(limits.begin(), limits.end()) - limits.begin());
ll dp[n + 1], sum[n + 1], inv[n + 1];
memset(dp, 0, sizeof(dp));
memset(sum, 0, sizeof(sum));
sum[0] = 1;
inv[1] = 1;
for (int i = 2; i <= n; i++) inv[i] = mod(inv[MOD % i] - MOD / i);
for (int region = 1; region < limits.size(); region++) {
ll len = limits[region] - limits[region - 1];
for (int i = 1; i <= n; i++) {
sum[i] = mod(sum[i - 1] + dp[i]);
if (va[i] >= limits[region] || vb[i] <= limits[region - 1]) continue;
ll bin = 0;
for (int k = i, cnt = 0; k >= 1; k--) {
if (va[k] >= limits[region] || vb[k] <= limits[region - 1]) continue;
cnt++;
bin = mod(mod(bin * (len + cnt - 2)) * inv[cnt]);
if (cnt == 1) {
dp[i] += mod(sum[k - 1] * len);
} else {
dp[i] += mod(sum[k - 1] * bin);
}
}
dp[i] %= MOD;
}
}
ll ans = 0;
for (int i = 1; i <= n; i++) ans += dp[i];
printf("%lld\n", ans % 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... |