oj.uz

Submission #40752

# Submission time Handle Problem Language Result Execution time Memory
40752 2018-02-08T02:54:37 Z ssnsarang2023 Boat (APIO16_boat) C++14
100 / 100
 474 ms 3820 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], a[N], b[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())));
	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] * fast_pw(j, mod - 2) % mod;
		}
	}
	for (int i = 0; i <= n; ++i) choose[i][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;
	}
	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) {
			if (j == 1) {
				for (int k = 0; k <= m; ++k) c1[k] = 0;
				c1[1] = len[i];
				for (int k = 2; k <= m; ++k) {
					int s = k - j + 1;
					for (int x = 2; x <= min(s, len[i]); ++x)
						c1[s] = (c1[s] + 1ll * lenCk[i][x] * choose[s - 2][x - 2]) % mod;
				}
			}
			for (int k = j; k <= m; ++k)
				f[k] = (f[k] + 1ll * c1[k- j + 1] * (g[tmp[j] - 1] + 1)) % mod;
		}
		for (int j = 1, cur = 0, k = 1; j <= n; ++j) {
			while (k <= m && tmp[k] == j) cur = (cur + f[k]) % mod, f[k] = 0, ++k;
			g[j] = (g[j] + cur) % mod;
		}
	}
	printf("%d", g[n]);
	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]);
                              ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 3320 KB Output is correct
2 Correct 58 ms 3424 KB Output is correct
3 Correct 59 ms 3424 KB Output is correct
4 Correct 58 ms 3548 KB Output is correct
5 Correct 59 ms 3548 KB Output is correct
6 Correct 58 ms 3548 KB Output is correct
7 Correct 57 ms 3548 KB Output is correct
8 Correct 60 ms 3548 KB Output is correct
9 Correct 58 ms 3548 KB Output is correct
10 Correct 59 ms 3552 KB Output is correct
11 Correct 58 ms 3552 KB Output is correct
12 Correct 58 ms 3676 KB Output is correct
13 Correct 59 ms 3676 KB Output is correct
14 Correct 59 ms 3676 KB Output is correct
15 Correct 57 ms 3676 KB Output is correct
16 Correct 13 ms 3676 KB Output is correct
17 Correct 13 ms 3676 KB Output is correct
18 Correct 13 ms 3676 KB Output is correct
19 Correct 13 ms 3676 KB Output is correct
20 Correct 13 ms 3676 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 3320 KB Output is correct
2 Correct 58 ms 3424 KB Output is correct
3 Correct 59 ms 3424 KB Output is correct
4 Correct 58 ms 3548 KB Output is correct
5 Correct 59 ms 3548 KB Output is correct
6 Correct 58 ms 3548 KB Output is correct
7 Correct 57 ms 3548 KB Output is correct
8 Correct 60 ms 3548 KB Output is correct
9 Correct 58 ms 3548 KB Output is correct
10 Correct 59 ms 3552 KB Output is correct
11 Correct 58 ms 3552 KB Output is correct
12 Correct 58 ms 3676 KB Output is correct
13 Correct 59 ms 3676 KB Output is correct
14 Correct 59 ms 3676 KB Output is correct
15 Correct 57 ms 3676 KB Output is correct
16 Correct 13 ms 3676 KB Output is correct
17 Correct 13 ms 3676 KB Output is correct
18 Correct 13 ms 3676 KB Output is correct
19 Correct 13 ms 3676 KB Output is correct
20 Correct 13 ms 3676 KB Output is correct
21 Correct 55 ms 3676 KB Output is correct
22 Correct 58 ms 3676 KB Output is correct
23 Correct 47 ms 3676 KB Output is correct
24 Correct 53 ms 3676 KB Output is correct
25 Correct 54 ms 3676 KB Output is correct
26 Correct 107 ms 3676 KB Output is correct
27 Correct 121 ms 3676 KB Output is correct
28 Correct 107 ms 3676 KB Output is correct
29 Correct 106 ms 3676 KB Output is correct
30 Correct 53 ms 3676 KB Output is correct
31 Correct 55 ms 3676 KB Output is correct
32 Correct 53 ms 3676 KB Output is correct
33 Correct 54 ms 3676 KB Output is correct
34 Correct 53 ms 3676 KB Output is correct
35 Correct 53 ms 3676 KB Output is correct
36 Correct 54 ms 3676 KB Output is correct
37 Correct 55 ms 3692 KB Output is correct
38 Correct 55 ms 3692 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3692 KB Output is correct
2 Correct 7 ms 3692 KB Output is correct
3 Correct 7 ms 3692 KB Output is correct
4 Correct 7 ms 3692 KB Output is correct
5 Correct 7 ms 3692 KB Output is correct
6 Correct 9 ms 3692 KB Output is correct
7 Correct 9 ms 3692 KB Output is correct
8 Correct 9 ms 3692 KB Output is correct
9 Correct 10 ms 3692 KB Output is correct
10 Correct 9 ms 3692 KB Output is correct
11 Correct 8 ms 3692 KB Output is correct
12 Correct 7 ms 3692 KB Output is correct
13 Correct 9 ms 3692 KB Output is correct
14 Correct 7 ms 3692 KB Output is correct
15 Correct 8 ms 3692 KB Output is correct
16 Correct 4 ms 3692 KB Output is correct
17 Correct 4 ms 3692 KB Output is correct
18 Correct 4 ms 3692 KB Output is correct
19 Correct 5 ms 3692 KB Output is correct
20 Correct 5 ms 3692 KB Output is correct

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 3320 KB Output is correct
2 Correct 58 ms 3424 KB Output is correct
3 Correct 59 ms 3424 KB Output is correct
4 Correct 58 ms 3548 KB Output is correct
5 Correct 59 ms 3548 KB Output is correct
6 Correct 58 ms 3548 KB Output is correct
7 Correct 57 ms 3548 KB Output is correct
8 Correct 60 ms 3548 KB Output is correct
9 Correct 58 ms 3548 KB Output is correct
10 Correct 59 ms 3552 KB Output is correct
11 Correct 58 ms 3552 KB Output is correct
12 Correct 58 ms 3676 KB Output is correct
13 Correct 59 ms 3676 KB Output is correct
14 Correct 59 ms 3676 KB Output is correct
15 Correct 57 ms 3676 KB Output is correct
16 Correct 13 ms 3676 KB Output is correct
17 Correct 13 ms 3676 KB Output is correct
18 Correct 13 ms 3676 KB Output is correct
19 Correct 13 ms 3676 KB Output is correct
20 Correct 13 ms 3676 KB Output is correct
21 Correct 55 ms 3676 KB Output is correct
22 Correct 58 ms 3676 KB Output is correct
23 Correct 47 ms 3676 KB Output is correct
24 Correct 53 ms 3676 KB Output is correct
25 Correct 54 ms 3676 KB Output is correct
26 Correct 107 ms 3676 KB Output is correct
27 Correct 121 ms 3676 KB Output is correct
28 Correct 107 ms 3676 KB Output is correct
29 Correct 106 ms 3676 KB Output is correct
30 Correct 53 ms 3676 KB Output is correct
31 Correct 55 ms 3676 KB Output is correct
32 Correct 53 ms 3676 KB Output is correct
33 Correct 54 ms 3676 KB Output is correct
34 Correct 53 ms 3676 KB Output is correct
35 Correct 53 ms 3676 KB Output is correct
36 Correct 54 ms 3676 KB Output is correct
37 Correct 55 ms 3692 KB Output is correct
38 Correct 55 ms 3692 KB Output is correct
39 Correct 7 ms 3692 KB Output is correct
40 Correct 7 ms 3692 KB Output is correct
41 Correct 7 ms 3692 KB Output is correct
42 Correct 7 ms 3692 KB Output is correct
43 Correct 7 ms 3692 KB Output is correct
44 Correct 9 ms 3692 KB Output is correct
45 Correct 9 ms 3692 KB Output is correct
46 Correct 9 ms 3692 KB Output is correct
47 Correct 10 ms 3692 KB Output is correct
48 Correct 9 ms 3692 KB Output is correct
49 Correct 8 ms 3692 KB Output is correct
50 Correct 7 ms 3692 KB Output is correct
51 Correct 9 ms 3692 KB Output is correct
52 Correct 7 ms 3692 KB Output is correct
53 Correct 8 ms 3692 KB Output is correct
54 Correct 4 ms 3692 KB Output is correct
55 Correct 4 ms 3692 KB Output is correct
56 Correct 4 ms 3692 KB Output is correct
57 Correct 5 ms 3692 KB Output is correct
58 Correct 5 ms 3692 KB Output is correct
59 Correct 271 ms 3692 KB Output is correct
60 Correct 247 ms 3692 KB Output is correct
61 Correct 241 ms 3820 KB Output is correct
62 Correct 268 ms 3820 KB Output is correct
63 Correct 263 ms 3820 KB Output is correct
64 Correct 474 ms 3820 KB Output is correct
65 Correct 465 ms 3820 KB Output is correct
66 Correct 465 ms 3820 KB Output is correct
67 Correct 472 ms 3820 KB Output is correct
68 Correct 472 ms 3820 KB Output is correct
69 Correct 243 ms 3820 KB Output is correct
70 Correct 242 ms 3820 KB Output is correct
71 Correct 245 ms 3820 KB Output is correct
72 Correct 254 ms 3820 KB Output is correct
73 Correct 253 ms 3820 KB Output is correct
74 Correct 33 ms 3820 KB Output is correct
75 Correct 33 ms 3820 KB Output is correct
76 Correct 34 ms 3820 KB Output is correct
77 Correct 34 ms 3820 KB Output is correct
78 Correct 40 ms 3820 KB Output is correct