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;
typedef unsigned long long ull;
typedef pair<int, int> ii;
#define SZ(x) ((int)x.size())
const int mod = (int)1e9+7;
const int N = 505;
int n, f[N], g[N], ftmp[N], a[N], b[N], inv[N], tmp[N], m;
int choose[N][N], len[N<<1], lenCk[N<<1][N], c1[N];
vector<int> c;
int mul(int x, int y) {
x %= mod, y %= mod;
if (x < 0) x += mod;
if (y < 0) y += mod;
ll re = (ll)x * (ll)y % (ll)mod;
return (int)re;
}
void add(int &x, int y) {
x += y, x %= mod;
if (x < 0) x += mod;
}
int fast_pw(int x, int y) {
if (y == 1) return x % mod;
if (y == 0) return 1;
int t = fast_pw(x, y >> 1);
t = mul(t, t);
if (y & 1) t = mul(t, x);
return t;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d%d", &a[i], &b[i]);
++b[i];
c.push_back(a[i]);
c.push_back(b[i]);
}
sort(c.begin(), c.end());
c.resize(distance(c.begin(), unique(c.begin(), c.end())));
for (int i = 0; i <= n; ++i) choose[i][i] = choose[i][0] = 1;
inv[0] = f[0] = g[0] = 1;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j < i; ++j) choose[i][j] = (choose[i - 1][j - 1] + choose[i - 1][j]) % mod;
inv[i] = fast_pw(i, mod - 2);
g[i] = 1;
}
int sz = 0;
for (int i = 0; i < SZ(c); ++i) {
len[++sz] = c[i + 1] - c[i];
lenCk[sz][0] = 1;
for (int j = 1; j <= min(len[sz], n); ++j) {
lenCk[sz][j] = mul(lenCk[sz][j - 1], len[sz] - j + 1);
lenCk[sz][j] = mul(lenCk[sz][j], inv[j]);
}
}
for (int i = 1; i <= sz; ++i) {
m = 0;
for (int j = 1; j <= n; ++j)
if (a[j] <= c[i - 1] && c[i] <= b[j])
tmp[++m] = j;
for (int j = 1; j <= m; ++j) {
int id = tmp[j];
if (j == 1) {
for (int k = 0; k <= m; ++k) c1[k] = 0;
c1[1] = lenCk[i][1];
for (int k = 2; k <= m; ++k)
for (int x = 2; x <= min(k, len[i]); ++x)
add(c1[k], mul(lenCk[i][x], choose[k - 2][x - 2]));
}
for (int k = j; k <= m; ++k) {
int mid = k - j + 1, id2 = tmp[k];
add(ftmp[id2], mul(c1[mid], g[id - 1]));
}
}
g[0] = 1;
for (int j = 1; j <= n; ++j) {
add(f[j], ftmp[j]);
g[j] = (g[j - 1] + f[j]) % mod;
ftmp[j] = 0;
}
}
printf("%d", (g[n] - 1 + mod) % mod);
return 0;
}
Compilation message (stderr)
boat.cpp: In function 'int main()':
boat.cpp:40:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
boat.cpp:42:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &a[i], &b[i]);
^
# | 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... |