oj.uz

Submission #109361

# Submission time Handle Problem Language Result Execution time Memory
109361 2019-05-06T09:28:52 Z b2563125 Boat (APIO16_boat) C++14
58 / 100
 2000 ms 14840 KB 
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
#define int long long
#define vel vector<long long>
#define V vector
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
int pr = 1000000007;
void uni(vel &a) {
	vel ans(1, a[0]);
	int n = a.size();
	rep(i,n - 1) { if (a[i + 1] != a[i]) { ans.push_back(a[i + 1]); } }
	a = ans;
}
int rui(int a, int n) {
	if (n == 0) { return 1; }
	int back = rui(a, n / 2);
	back *= back; back %= pr;
	if (n % 2 == 0) { return back; }
	return (back*a) % pr;
}
int inv(int a) {
	return rui(a, pr - 2);
}
signed main() {
	int n; cin >> n;
	vel a(n);
	vel b(n);
	vel all_time(1, 0);
	rep(i, n) {
		cin >> a[i] >> b[i]; b[i]++;
		all_time.push_back(a[i]);
		all_time.push_back(b[i]);
	}
	sort(all_time.begin(), all_time.end());
	uni(all_time);
	int sz = all_time.size();
	vel gap(sz - 1);
	rep(i, sz - 1) { gap[i] = all_time[i + 1] - all_time[i]; }
	vel count(sz-1);
	rep(i, n) {
		a[i] = lower_bound(all_time.begin(), all_time.end(), a[i])-all_time.begin();
		b[i] = lower_bound(all_time.begin(), all_time.end(), b[i])-all_time.begin();
		rep(j, b[i] - a[i]) {
			count[a[i] + j]++;
		}
	}
	V<vel> com(sz-1);
	rep(i, sz-1) {
		int ba = 1;
		rep(j, count[i]) {
			ba *= gap[i] - j; ba %= pr;
			ba *= inv(j + 1); ba %= pr;
			com[i].push_back(ba);
		}
	}
	V<V<vel>> dp1(2, V<vel>(sz-1,vel(n)));
	vel now_count(sz - 1, 0);
	rep(i, n) {
		int now = i % 2;
		int nex = (i + 1) % 2;
		dp1[nex] = dp1[now];
		int sum = 1;
		rep(j, a[i]) {
			rep(k, now_count[j]) {
				sum += dp1[now][j][k] * com[j][k];
				sum %= pr;
			}
		}
		for (int j = a[i]; j < b[i]; j++) {
			dp1[nex][j][0] += sum; dp1[nex][j][0] %= pr;
			rep(k, now_count[j]) {
				dp1[nex][j][k + 1] += dp1[now][j][k]; dp1[nex][j][k + 1] %= pr;
				sum += dp1[now][j][k] * com[j][k];
				sum %= pr;
			}
			sum += dp1[now][j][now_count[j]] * com[j][now_count[j]];
			sum %= pr;
			now_count[j]++;
		}
	}
	int ans = 0;
	rep(i, sz-1) {
		rep(k, count[i]) {
			ans += dp1[n%2][i][k] * com[i][k];
			ans %= pr;
		}
	}
	cout << ans << endl;
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 12288 KB Output is correct
2 Correct 196 ms 12400 KB Output is correct
3 Correct 200 ms 12288 KB Output is correct
4 Correct 226 ms 12416 KB Output is correct
5 Correct 218 ms 12288 KB Output is correct
6 Correct 226 ms 12288 KB Output is correct
7 Correct 177 ms 12288 KB Output is correct
8 Correct 209 ms 12328 KB Output is correct
9 Correct 211 ms 12288 KB Output is correct
10 Correct 210 ms 12292 KB Output is correct
11 Correct 223 ms 12288 KB Output is correct
12 Correct 211 ms 12288 KB Output is correct
13 Correct 225 ms 12288 KB Output is correct
14 Correct 225 ms 12260 KB Output is correct
15 Correct 226 ms 12380 KB Output is correct
16 Correct 35 ms 2432 KB Output is correct
17 Correct 41 ms 2560 KB Output is correct
18 Correct 34 ms 2552 KB Output is correct
19 Correct 40 ms 2688 KB Output is correct
20 Correct 37 ms 2560 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 12288 KB Output is correct
2 Correct 196 ms 12400 KB Output is correct
3 Correct 200 ms 12288 KB Output is correct
4 Correct 226 ms 12416 KB Output is correct
5 Correct 218 ms 12288 KB Output is correct
6 Correct 226 ms 12288 KB Output is correct
7 Correct 177 ms 12288 KB Output is correct
8 Correct 209 ms 12328 KB Output is correct
9 Correct 211 ms 12288 KB Output is correct
10 Correct 210 ms 12292 KB Output is correct
11 Correct 223 ms 12288 KB Output is correct
12 Correct 211 ms 12288 KB Output is correct
13 Correct 225 ms 12288 KB Output is correct
14 Correct 225 ms 12260 KB Output is correct
15 Correct 226 ms 12380 KB Output is correct
16 Correct 35 ms 2432 KB Output is correct
17 Correct 41 ms 2560 KB Output is correct
18 Correct 34 ms 2552 KB Output is correct
19 Correct 40 ms 2688 KB Output is correct
20 Correct 37 ms 2560 KB Output is correct
21 Correct 1006 ms 12948 KB Output is correct
22 Correct 1080 ms 13048 KB Output is correct
23 Correct 1038 ms 12664 KB Output is correct
24 Correct 1139 ms 12756 KB Output is correct
25 Correct 1096 ms 12768 KB Output is correct
26 Correct 1677 ms 13304 KB Output is correct
27 Correct 1650 ms 13464 KB Output is correct
28 Correct 1624 ms 13156 KB Output is correct
29 Correct 1540 ms 13180 KB Output is correct
30 Correct 207 ms 12408 KB Output is correct
31 Correct 214 ms 12288 KB Output is correct
32 Correct 222 ms 12280 KB Output is correct
33 Correct 211 ms 12288 KB Output is correct
34 Correct 214 ms 12280 KB Output is correct
35 Correct 213 ms 12280 KB Output is correct
36 Correct 218 ms 12288 KB Output is correct
37 Correct 214 ms 12276 KB Output is correct
38 Correct 219 ms 12280 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 896 KB Output is correct
2 Correct 13 ms 972 KB Output is correct
3 Correct 17 ms 896 KB Output is correct
4 Correct 16 ms 896 KB Output is correct
5 Correct 15 ms 896 KB Output is correct
6 Correct 24 ms 1016 KB Output is correct
7 Correct 23 ms 768 KB Output is correct
8 Correct 24 ms 1024 KB Output is correct
9 Correct 27 ms 976 KB Output is correct
10 Correct 25 ms 896 KB Output is correct
11 Correct 18 ms 1024 KB Output is correct
12 Correct 15 ms 896 KB Output is correct
13 Correct 16 ms 868 KB Output is correct
14 Correct 16 ms 896 KB Output is correct
15 Correct 18 ms 896 KB Output is correct
16 Correct 10 ms 640 KB Output is correct
17 Correct 10 ms 640 KB Output is correct
18 Correct 10 ms 640 KB Output is correct
19 Correct 10 ms 640 KB Output is correct
20 Correct 9 ms 640 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 12288 KB Output is correct
2 Correct 196 ms 12400 KB Output is correct
3 Correct 200 ms 12288 KB Output is correct
4 Correct 226 ms 12416 KB Output is correct
5 Correct 218 ms 12288 KB Output is correct
6 Correct 226 ms 12288 KB Output is correct
7 Correct 177 ms 12288 KB Output is correct
8 Correct 209 ms 12328 KB Output is correct
9 Correct 211 ms 12288 KB Output is correct
10 Correct 210 ms 12292 KB Output is correct
11 Correct 223 ms 12288 KB Output is correct
12 Correct 211 ms 12288 KB Output is correct
13 Correct 225 ms 12288 KB Output is correct
14 Correct 225 ms 12260 KB Output is correct
15 Correct 226 ms 12380 KB Output is correct
16 Correct 35 ms 2432 KB Output is correct
17 Correct 41 ms 2560 KB Output is correct
18 Correct 34 ms 2552 KB Output is correct
19 Correct 40 ms 2688 KB Output is correct
20 Correct 37 ms 2560 KB Output is correct
21 Correct 1006 ms 12948 KB Output is correct
22 Correct 1080 ms 13048 KB Output is correct
23 Correct 1038 ms 12664 KB Output is correct
24 Correct 1139 ms 12756 KB Output is correct
25 Correct 1096 ms 12768 KB Output is correct
26 Correct 1677 ms 13304 KB Output is correct
27 Correct 1650 ms 13464 KB Output is correct
28 Correct 1624 ms 13156 KB Output is correct
29 Correct 1540 ms 13180 KB Output is correct
30 Correct 207 ms 12408 KB Output is correct
31 Correct 214 ms 12288 KB Output is correct
32 Correct 222 ms 12280 KB Output is correct
33 Correct 211 ms 12288 KB Output is correct
34 Correct 214 ms 12280 KB Output is correct
35 Correct 213 ms 12280 KB Output is correct
36 Correct 218 ms 12288 KB Output is correct
37 Correct 214 ms 12276 KB Output is correct
38 Correct 219 ms 12280 KB Output is correct
39 Correct 16 ms 896 KB Output is correct
40 Correct 13 ms 972 KB Output is correct
41 Correct 17 ms 896 KB Output is correct
42 Correct 16 ms 896 KB Output is correct
43 Correct 15 ms 896 KB Output is correct
44 Correct 24 ms 1016 KB Output is correct
45 Correct 23 ms 768 KB Output is correct
46 Correct 24 ms 1024 KB Output is correct
47 Correct 27 ms 976 KB Output is correct
48 Correct 25 ms 896 KB Output is correct
49 Correct 18 ms 1024 KB Output is correct
50 Correct 15 ms 896 KB Output is correct
51 Correct 16 ms 868 KB Output is correct
52 Correct 16 ms 896 KB Output is correct
53 Correct 18 ms 896 KB Output is correct
54 Correct 10 ms 640 KB Output is correct
55 Correct 10 ms 640 KB Output is correct
56 Correct 10 ms 640 KB Output is correct
57 Correct 10 ms 640 KB Output is correct
58 Correct 9 ms 640 KB Output is correct
59 Correct 1331 ms 13936 KB Output is correct
60 Correct 1296 ms 13944 KB Output is correct
61 Correct 1195 ms 13892 KB Output is correct
62 Correct 1364 ms 14256 KB Output is correct
63 Correct 1365 ms 13948 KB Output is correct
64 Execution timed out 2055 ms 14840 KB Time limit exceeded
65 Halted 0 ms 0 KB -