Submission #40753

# Submission time Handle Problem Language Result Execution time Memory
40753 2018-02-08T02:56:00 Z ssnsarang2023 Boat (APIO16_boat) C++14
100 / 100
580 ms 3816 KB
#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;
 
int fast_pw(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) res = 1ll * res * a % mod; 
		a = 1ll * a * a % mod;
		b >>= 1;
	}
	return res;
}
 
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*2], lenCk[N*2][N], c1[N];
vector<int> c;
 
void add(int &x, int y) {
	x += y, x %= mod;
	if (x < 0) x += mod;
}
 
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) - 1; ++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] = 1ll * lenCk[sz][j - 1] * (len[sz] - j + 1) % mod;
			lenCk[sz][j] = 1ll * lenCk[sz][j] * inv[j] % mod;
		}
	}
	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], 1ll * lenCk[i][x] * choose[k - 2][x - 2] % mod);
			}
			for (int k = j; k <= m; ++k) {
				int mid = k - j + 1, id2 = tmp[k];
				add(ftmp[id2], 1ll * c1[mid] * g[id - 1] % mod);
			}
		}
		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

boat.cpp: In function 'int main()':
boat.cpp:34:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
boat.cpp:36: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
1 Correct 12 ms 3320 KB Output is correct
2 Correct 12 ms 3320 KB Output is correct
3 Correct 12 ms 3372 KB Output is correct
4 Correct 13 ms 3440 KB Output is correct
5 Correct 12 ms 3480 KB Output is correct
6 Correct 11 ms 3492 KB Output is correct
7 Correct 11 ms 3492 KB Output is correct
8 Correct 13 ms 3492 KB Output is correct
9 Correct 13 ms 3492 KB Output is correct
10 Correct 11 ms 3492 KB Output is correct
11 Correct 11 ms 3492 KB Output is correct
12 Correct 11 ms 3492 KB Output is correct
13 Correct 11 ms 3492 KB Output is correct
14 Correct 11 ms 3548 KB Output is correct
15 Correct 11 ms 3548 KB Output is correct
16 Correct 4 ms 3548 KB Output is correct
17 Correct 4 ms 3548 KB Output is correct
18 Correct 6 ms 3548 KB Output is correct
19 Correct 5 ms 3548 KB Output is correct
20 Correct 5 ms 3548 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 12 ms 3320 KB Output is correct
2 Correct 12 ms 3320 KB Output is correct
3 Correct 12 ms 3372 KB Output is correct
4 Correct 13 ms 3440 KB Output is correct
5 Correct 12 ms 3480 KB Output is correct
6 Correct 11 ms 3492 KB Output is correct
7 Correct 11 ms 3492 KB Output is correct
8 Correct 13 ms 3492 KB Output is correct
9 Correct 13 ms 3492 KB Output is correct
10 Correct 11 ms 3492 KB Output is correct
11 Correct 11 ms 3492 KB Output is correct
12 Correct 11 ms 3492 KB Output is correct
13 Correct 11 ms 3492 KB Output is correct
14 Correct 11 ms 3548 KB Output is correct
15 Correct 11 ms 3548 KB Output is correct
16 Correct 4 ms 3548 KB Output is correct
17 Correct 4 ms 3548 KB Output is correct
18 Correct 6 ms 3548 KB Output is correct
19 Correct 5 ms 3548 KB Output is correct
20 Correct 5 ms 3548 KB Output is correct
21 Correct 106 ms 3548 KB Output is correct
22 Correct 95 ms 3548 KB Output is correct
23 Correct 81 ms 3548 KB Output is correct
24 Correct 92 ms 3548 KB Output is correct
25 Correct 98 ms 3548 KB Output is correct
26 Correct 200 ms 3548 KB Output is correct
27 Correct 202 ms 3548 KB Output is correct
28 Correct 199 ms 3548 KB Output is correct
29 Correct 217 ms 3548 KB Output is correct
30 Correct 11 ms 3552 KB Output is correct
31 Correct 11 ms 3564 KB Output is correct
32 Correct 10 ms 3692 KB Output is correct
33 Correct 12 ms 3692 KB Output is correct
34 Correct 11 ms 3692 KB Output is correct
35 Correct 12 ms 3692 KB Output is correct
36 Correct 12 ms 3692 KB Output is correct
37 Correct 13 ms 3692 KB Output is correct
38 Correct 14 ms 3692 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 3692 KB Output is correct
2 Correct 3 ms 3692 KB Output is correct
3 Correct 4 ms 3692 KB Output is correct
4 Correct 4 ms 3692 KB Output is correct
5 Correct 4 ms 3692 KB Output is correct
6 Correct 6 ms 3692 KB Output is correct
7 Correct 6 ms 3692 KB Output is correct
8 Correct 7 ms 3692 KB Output is correct
9 Correct 7 ms 3692 KB Output is correct
10 Correct 6 ms 3692 KB Output is correct
11 Correct 4 ms 3692 KB Output is correct
12 Correct 4 ms 3692 KB Output is correct
13 Correct 4 ms 3692 KB Output is correct
14 Correct 4 ms 3692 KB Output is correct
15 Correct 4 ms 3692 KB Output is correct
16 Correct 3 ms 3692 KB Output is correct
17 Correct 3 ms 3692 KB Output is correct
18 Correct 3 ms 3692 KB Output is correct
19 Correct 3 ms 3692 KB Output is correct
20 Correct 3 ms 3692 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 12 ms 3320 KB Output is correct
2 Correct 12 ms 3320 KB Output is correct
3 Correct 12 ms 3372 KB Output is correct
4 Correct 13 ms 3440 KB Output is correct
5 Correct 12 ms 3480 KB Output is correct
6 Correct 11 ms 3492 KB Output is correct
7 Correct 11 ms 3492 KB Output is correct
8 Correct 13 ms 3492 KB Output is correct
9 Correct 13 ms 3492 KB Output is correct
10 Correct 11 ms 3492 KB Output is correct
11 Correct 11 ms 3492 KB Output is correct
12 Correct 11 ms 3492 KB Output is correct
13 Correct 11 ms 3492 KB Output is correct
14 Correct 11 ms 3548 KB Output is correct
15 Correct 11 ms 3548 KB Output is correct
16 Correct 4 ms 3548 KB Output is correct
17 Correct 4 ms 3548 KB Output is correct
18 Correct 6 ms 3548 KB Output is correct
19 Correct 5 ms 3548 KB Output is correct
20 Correct 5 ms 3548 KB Output is correct
21 Correct 106 ms 3548 KB Output is correct
22 Correct 95 ms 3548 KB Output is correct
23 Correct 81 ms 3548 KB Output is correct
24 Correct 92 ms 3548 KB Output is correct
25 Correct 98 ms 3548 KB Output is correct
26 Correct 200 ms 3548 KB Output is correct
27 Correct 202 ms 3548 KB Output is correct
28 Correct 199 ms 3548 KB Output is correct
29 Correct 217 ms 3548 KB Output is correct
30 Correct 11 ms 3552 KB Output is correct
31 Correct 11 ms 3564 KB Output is correct
32 Correct 10 ms 3692 KB Output is correct
33 Correct 12 ms 3692 KB Output is correct
34 Correct 11 ms 3692 KB Output is correct
35 Correct 12 ms 3692 KB Output is correct
36 Correct 12 ms 3692 KB Output is correct
37 Correct 13 ms 3692 KB Output is correct
38 Correct 14 ms 3692 KB Output is correct
39 Correct 4 ms 3692 KB Output is correct
40 Correct 3 ms 3692 KB Output is correct
41 Correct 4 ms 3692 KB Output is correct
42 Correct 4 ms 3692 KB Output is correct
43 Correct 4 ms 3692 KB Output is correct
44 Correct 6 ms 3692 KB Output is correct
45 Correct 6 ms 3692 KB Output is correct
46 Correct 7 ms 3692 KB Output is correct
47 Correct 7 ms 3692 KB Output is correct
48 Correct 6 ms 3692 KB Output is correct
49 Correct 4 ms 3692 KB Output is correct
50 Correct 4 ms 3692 KB Output is correct
51 Correct 4 ms 3692 KB Output is correct
52 Correct 4 ms 3692 KB Output is correct
53 Correct 4 ms 3692 KB Output is correct
54 Correct 3 ms 3692 KB Output is correct
55 Correct 3 ms 3692 KB Output is correct
56 Correct 3 ms 3692 KB Output is correct
57 Correct 3 ms 3692 KB Output is correct
58 Correct 3 ms 3692 KB Output is correct
59 Correct 238 ms 3692 KB Output is correct
60 Correct 214 ms 3692 KB Output is correct
61 Correct 204 ms 3692 KB Output is correct
62 Correct 242 ms 3816 KB Output is correct
63 Correct 224 ms 3816 KB Output is correct
64 Correct 551 ms 3816 KB Output is correct
65 Correct 539 ms 3816 KB Output is correct
66 Correct 536 ms 3816 KB Output is correct
67 Correct 544 ms 3816 KB Output is correct
68 Correct 580 ms 3816 KB Output is correct
69 Correct 201 ms 3816 KB Output is correct
70 Correct 205 ms 3816 KB Output is correct
71 Correct 207 ms 3816 KB Output is correct
72 Correct 215 ms 3816 KB Output is correct
73 Correct 216 ms 3816 KB Output is correct
74 Correct 36 ms 3816 KB Output is correct
75 Correct 34 ms 3816 KB Output is correct
76 Correct 35 ms 3816 KB Output is correct
77 Correct 35 ms 3816 KB Output is correct
78 Correct 36 ms 3816 KB Output is correct