oj.uz

답안 #109371

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
109371 2019-05-06T09:49:32 Z b2563125 Boat (APIO16_boat) C++14
58 / 100
 2000 ms 14968 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() {
	ll 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;
			}
			now_count[j]++;
		}
	}
	ll 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

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 12288 KB Output is correct
2 Correct 202 ms 12292 KB Output is correct
3 Correct 179 ms 12288 KB Output is correct
4 Correct 197 ms 12408 KB Output is correct
5 Correct 202 ms 12288 KB Output is correct
6 Correct 185 ms 12288 KB Output is correct
7 Correct 188 ms 12380 KB Output is correct
8 Correct 233 ms 12328 KB Output is correct
9 Correct 203 ms 12408 KB Output is correct
10 Correct 196 ms 12288 KB Output is correct
11 Correct 168 ms 12288 KB Output is correct
12 Correct 214 ms 12432 KB Output is correct
13 Correct 196 ms 12288 KB Output is correct
14 Correct 171 ms 12288 KB Output is correct
15 Correct 192 ms 12288 KB Output is correct
16 Correct 37 ms 2432 KB Output is correct
17 Correct 34 ms 2688 KB Output is correct
18 Correct 37 ms 2432 KB Output is correct
19 Correct 35 ms 2680 KB Output is correct
20 Correct 39 ms 2560 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 12288 KB Output is correct
2 Correct 202 ms 12292 KB Output is correct
3 Correct 179 ms 12288 KB Output is correct
4 Correct 197 ms 12408 KB Output is correct
5 Correct 202 ms 12288 KB Output is correct
6 Correct 185 ms 12288 KB Output is correct
7 Correct 188 ms 12380 KB Output is correct
8 Correct 233 ms 12328 KB Output is correct
9 Correct 203 ms 12408 KB Output is correct
10 Correct 196 ms 12288 KB Output is correct
11 Correct 168 ms 12288 KB Output is correct
12 Correct 214 ms 12432 KB Output is correct
13 Correct 196 ms 12288 KB Output is correct
14 Correct 171 ms 12288 KB Output is correct
15 Correct 192 ms 12288 KB Output is correct
16 Correct 37 ms 2432 KB Output is correct
17 Correct 34 ms 2688 KB Output is correct
18 Correct 37 ms 2432 KB Output is correct
19 Correct 35 ms 2680 KB Output is correct
20 Correct 39 ms 2560 KB Output is correct
21 Correct 1114 ms 12844 KB Output is correct
22 Correct 1166 ms 13048 KB Output is correct
23 Correct 940 ms 12792 KB Output is correct
24 Correct 856 ms 12664 KB Output is correct
25 Correct 1121 ms 12636 KB Output is correct
26 Correct 1803 ms 13212 KB Output is correct
27 Correct 1840 ms 13412 KB Output is correct
28 Correct 1951 ms 13316 KB Output is correct
29 Correct 1499 ms 13176 KB Output is correct
30 Correct 190 ms 12280 KB Output is correct
31 Correct 205 ms 12288 KB Output is correct
32 Correct 213 ms 12280 KB Output is correct
33 Correct 206 ms 12408 KB Output is correct
34 Correct 223 ms 12256 KB Output is correct
35 Correct 218 ms 12288 KB Output is correct
36 Correct 241 ms 12280 KB Output is correct
37 Correct 196 ms 12280 KB Output is correct
38 Correct 195 ms 12288 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 1024 KB Output is correct
2 Correct 12 ms 896 KB Output is correct
3 Correct 15 ms 896 KB Output is correct
4 Correct 14 ms 896 KB Output is correct
5 Correct 15 ms 896 KB Output is correct
6 Correct 23 ms 1020 KB Output is correct
7 Correct 22 ms 1024 KB Output is correct
8 Correct 22 ms 896 KB Output is correct
9 Correct 22 ms 896 KB Output is correct
10 Correct 22 ms 896 KB Output is correct
11 Correct 16 ms 896 KB Output is correct
12 Correct 18 ms 896 KB Output is correct
13 Correct 17 ms 896 KB Output is correct
14 Correct 16 ms 896 KB Output is correct
15 Correct 18 ms 896 KB Output is correct
16 Correct 11 ms 640 KB Output is correct
17 Correct 10 ms 640 KB Output is correct
18 Correct 9 ms 640 KB Output is correct
19 Correct 10 ms 612 KB Output is correct
20 Correct 12 ms 640 KB Output is correct

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 12288 KB Output is correct
2 Correct 202 ms 12292 KB Output is correct
3 Correct 179 ms 12288 KB Output is correct
4 Correct 197 ms 12408 KB Output is correct
5 Correct 202 ms 12288 KB Output is correct
6 Correct 185 ms 12288 KB Output is correct
7 Correct 188 ms 12380 KB Output is correct
8 Correct 233 ms 12328 KB Output is correct
9 Correct 203 ms 12408 KB Output is correct
10 Correct 196 ms 12288 KB Output is correct
11 Correct 168 ms 12288 KB Output is correct
12 Correct 214 ms 12432 KB Output is correct
13 Correct 196 ms 12288 KB Output is correct
14 Correct 171 ms 12288 KB Output is correct
15 Correct 192 ms 12288 KB Output is correct
16 Correct 37 ms 2432 KB Output is correct
17 Correct 34 ms 2688 KB Output is correct
18 Correct 37 ms 2432 KB Output is correct
19 Correct 35 ms 2680 KB Output is correct
20 Correct 39 ms 2560 KB Output is correct
21 Correct 1114 ms 12844 KB Output is correct
22 Correct 1166 ms 13048 KB Output is correct
23 Correct 940 ms 12792 KB Output is correct
24 Correct 856 ms 12664 KB Output is correct
25 Correct 1121 ms 12636 KB Output is correct
26 Correct 1803 ms 13212 KB Output is correct
27 Correct 1840 ms 13412 KB Output is correct
28 Correct 1951 ms 13316 KB Output is correct
29 Correct 1499 ms 13176 KB Output is correct
30 Correct 190 ms 12280 KB Output is correct
31 Correct 205 ms 12288 KB Output is correct
32 Correct 213 ms 12280 KB Output is correct
33 Correct 206 ms 12408 KB Output is correct
34 Correct 223 ms 12256 KB Output is correct
35 Correct 218 ms 12288 KB Output is correct
36 Correct 241 ms 12280 KB Output is correct
37 Correct 196 ms 12280 KB Output is correct
38 Correct 195 ms 12288 KB Output is correct
39 Correct 19 ms 1024 KB Output is correct
40 Correct 12 ms 896 KB Output is correct
41 Correct 15 ms 896 KB Output is correct
42 Correct 14 ms 896 KB Output is correct
43 Correct 15 ms 896 KB Output is correct
44 Correct 23 ms 1020 KB Output is correct
45 Correct 22 ms 1024 KB Output is correct
46 Correct 22 ms 896 KB Output is correct
47 Correct 22 ms 896 KB Output is correct
48 Correct 22 ms 896 KB Output is correct
49 Correct 16 ms 896 KB Output is correct
50 Correct 18 ms 896 KB Output is correct
51 Correct 17 ms 896 KB Output is correct
52 Correct 16 ms 896 KB Output is correct
53 Correct 18 ms 896 KB Output is correct
54 Correct 11 ms 640 KB Output is correct
55 Correct 10 ms 640 KB Output is correct
56 Correct 9 ms 640 KB Output is correct
57 Correct 10 ms 612 KB Output is correct
58 Correct 12 ms 640 KB Output is correct
59 Correct 1171 ms 14004 KB Output is correct
60 Correct 1083 ms 13816 KB Output is correct
61 Correct 1195 ms 14036 KB Output is correct
62 Correct 1316 ms 14200 KB Output is correct
63 Correct 1285 ms 13816 KB Output is correct
64 Execution timed out 2039 ms 14968 KB Time limit exceeded
65 Halted 0 ms 0 KB -