oj.uz

답안 #200731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
200731 2020-02-08T04:51:53 Z dimash241 Boat (APIO16_boat) C++17
100 / 100
 1872 ms 18424 KB 
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
 
# include <x86intrin.h>
# include <bits/stdc++.h>
 
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>
 
using namespace __gnu_pbds;
using namespace std;
 
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red
 
inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}
 
const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;
 
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n;
ll dp[505][1010];
ll p[1001][1010];
int C1[1001][1001];
int C2[1001][1001];
int l[505], r[505];
int vv[N], ptr;
ll inv[N];
ll pw[N];
 
ll bpow (ll a, ll b) {
	ll res = 1;
	while (b > 0) {
		if (b & 1) (res *= a) %= mod;
		(a *= a) %= mod;
		b /= 2;
	}
	return res;
}
 
 
ll C(ll n, int k) {
	ll res = inv[k];
	for (int i = 0; i < k; ++i) {
		res *= (n - i);
		res %= mod;
	}
  
	return res;
}      
 
int main () {
   	SpeedForce;
 
	inv[0] = 1;
	pw[0] = 1;
	for (int i = 1; i < 1001;i ++) {
		inv[i] = inv[i-1] * bpow(i, mod - 2) % mod;
		pw[i] = (pw[i-1] + pw[i-1]) % mod;
	}
 
	cin >> n;
 
	for (int i = 1; i <= n; ++i) {
		cin >> l[i] >> r[i];
		r[i]++;
		vv[ptr++] = l[i];
		vv[ptr++] = r[i];
	}
	sort(vv, vv + ptr);
	ptr = unique(vv, vv + ptr) - vv;
	for (int i = 0; i < ptr; ++i) dp[0][i] = 1;
    for (int i = 1; i < ptr; ++i) {
		for (int j = 1; j <= n; ++j)
			C2[i][j] = C(vv[i] - vv[i-1], j);
	}
 
	for (int i = 0; i <= n; ++i)
		C1[i][i] = C1[i][0] = 1;

	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j < i; ++j)
			C1[i][j] = (C1[i-1][j] + C1[i-1][j-1]) % mod;
	}
 
	for (int i = 1; i < ptr; ++i) {
		for (int k = 1; k <= n; ++k) {
			for (int j = 1; j <= k; ++j)
				p[i][k] = (p[i][k] + C2[i][j] * (ll)C1[k-1][j-1]) % mod;
		}
	}

	for (int i = 0; i < ptr; ++i)
		dp[0][i] = 1;
	for (int i = 0; i <= n; ++i)
		dp[i][0] = 1;
 
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j < ptr; ++j) {
			dp[i][j] = dp[i][j-1];
 
			int cnt = 0;
 
			for (int k = i; k>=1; --k) {
				if (l[k] <= vv[j-1] && vv[j] <= r[k]) {
					++cnt;
					dp[i][j] = (dp[i][j] + dp[k-1][j-1] * p[j][cnt]) % mod;
					if (!p[j][cnt]) break;
				}
			}
		}
	}
 
	int ans = (dp[n][ptr-1] - 1 + mod) % mod;
	assert(ans >= 0);
 
	cout << ans << '\n';
	return Accepted;
}
 
// B...a

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1544 ms 18296 KB Output is correct
2 Correct 1553 ms 18172 KB Output is correct
3 Correct 1545 ms 18260 KB Output is correct
4 Correct 1545 ms 18424 KB Output is correct
5 Correct 1532 ms 18192 KB Output is correct
6 Correct 1428 ms 18424 KB Output is correct
7 Correct 1423 ms 18168 KB Output is correct
8 Correct 1427 ms 18168 KB Output is correct
9 Correct 1431 ms 18244 KB Output is correct
10 Correct 1456 ms 18168 KB Output is correct
11 Correct 1420 ms 18084 KB Output is correct
12 Correct 1431 ms 18284 KB Output is correct
13 Correct 1437 ms 18168 KB Output is correct
14 Correct 1428 ms 18264 KB Output is correct
15 Correct 1426 ms 18168 KB Output is correct
16 Correct 286 ms 7416 KB Output is correct
17 Correct 316 ms 7544 KB Output is correct
18 Correct 321 ms 7416 KB Output is correct
19 Correct 310 ms 7284 KB Output is correct
20 Correct 295 ms 7288 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1544 ms 18296 KB Output is correct
2 Correct 1553 ms 18172 KB Output is correct
3 Correct 1545 ms 18260 KB Output is correct
4 Correct 1545 ms 18424 KB Output is correct
5 Correct 1532 ms 18192 KB Output is correct
6 Correct 1428 ms 18424 KB Output is correct
7 Correct 1423 ms 18168 KB Output is correct
8 Correct 1427 ms 18168 KB Output is correct
9 Correct 1431 ms 18244 KB Output is correct
10 Correct 1456 ms 18168 KB Output is correct
11 Correct 1420 ms 18084 KB Output is correct
12 Correct 1431 ms 18284 KB Output is correct
13 Correct 1437 ms 18168 KB Output is correct
14 Correct 1428 ms 18264 KB Output is correct
15 Correct 1426 ms 18168 KB Output is correct
16 Correct 286 ms 7416 KB Output is correct
17 Correct 316 ms 7544 KB Output is correct
18 Correct 321 ms 7416 KB Output is correct
19 Correct 310 ms 7284 KB Output is correct
20 Correct 295 ms 7288 KB Output is correct
21 Correct 1579 ms 17192 KB Output is correct
22 Correct 1560 ms 17436 KB Output is correct
23 Correct 1582 ms 17252 KB Output is correct
24 Correct 1625 ms 17016 KB Output is correct
25 Correct 1648 ms 17144 KB Output is correct
26 Correct 1641 ms 16828 KB Output is correct
27 Correct 1700 ms 16888 KB Output is correct
28 Correct 1616 ms 16888 KB Output is correct
29 Correct 1620 ms 16800 KB Output is correct
30 Correct 1420 ms 18168 KB Output is correct
31 Correct 1450 ms 18340 KB Output is correct
32 Correct 1449 ms 18116 KB Output is correct
33 Correct 1456 ms 18128 KB Output is correct
34 Correct 1422 ms 18296 KB Output is correct
35 Correct 1559 ms 18160 KB Output is correct
36 Correct 1554 ms 18296 KB Output is correct
37 Correct 1554 ms 18296 KB Output is correct
38 Correct 1562 ms 18424 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 3064 KB Output is correct
2 Correct 19 ms 3064 KB Output is correct
3 Correct 20 ms 3192 KB Output is correct
4 Correct 20 ms 3064 KB Output is correct
5 Correct 21 ms 3064 KB Output is correct
6 Correct 21 ms 3068 KB Output is correct
7 Correct 21 ms 3064 KB Output is correct
8 Correct 23 ms 3064 KB Output is correct
9 Correct 21 ms 3064 KB Output is correct
10 Correct 21 ms 3064 KB Output is correct
11 Correct 20 ms 3064 KB Output is correct
12 Correct 19 ms 3060 KB Output is correct
13 Correct 20 ms 3064 KB Output is correct
14 Correct 20 ms 3064 KB Output is correct
15 Correct 20 ms 3068 KB Output is correct
16 Correct 14 ms 2300 KB Output is correct
17 Correct 14 ms 2168 KB Output is correct
18 Correct 14 ms 2224 KB Output is correct
19 Correct 14 ms 2172 KB Output is correct
20 Correct 14 ms 2168 KB Output is correct

Subtask #4
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1544 ms 18296 KB Output is correct
2 Correct 1553 ms 18172 KB Output is correct
3 Correct 1545 ms 18260 KB Output is correct
4 Correct 1545 ms 18424 KB Output is correct
5 Correct 1532 ms 18192 KB Output is correct
6 Correct 1428 ms 18424 KB Output is correct
7 Correct 1423 ms 18168 KB Output is correct
8 Correct 1427 ms 18168 KB Output is correct
9 Correct 1431 ms 18244 KB Output is correct
10 Correct 1456 ms 18168 KB Output is correct
11 Correct 1420 ms 18084 KB Output is correct
12 Correct 1431 ms 18284 KB Output is correct
13 Correct 1437 ms 18168 KB Output is correct
14 Correct 1428 ms 18264 KB Output is correct
15 Correct 1426 ms 18168 KB Output is correct
16 Correct 286 ms 7416 KB Output is correct
17 Correct 316 ms 7544 KB Output is correct
18 Correct 321 ms 7416 KB Output is correct
19 Correct 310 ms 7284 KB Output is correct
20 Correct 295 ms 7288 KB Output is correct
21 Correct 1579 ms 17192 KB Output is correct
22 Correct 1560 ms 17436 KB Output is correct
23 Correct 1582 ms 17252 KB Output is correct
24 Correct 1625 ms 17016 KB Output is correct
25 Correct 1648 ms 17144 KB Output is correct
26 Correct 1641 ms 16828 KB Output is correct
27 Correct 1700 ms 16888 KB Output is correct
28 Correct 1616 ms 16888 KB Output is correct
29 Correct 1620 ms 16800 KB Output is correct
30 Correct 1420 ms 18168 KB Output is correct
31 Correct 1450 ms 18340 KB Output is correct
32 Correct 1449 ms 18116 KB Output is correct
33 Correct 1456 ms 18128 KB Output is correct
34 Correct 1422 ms 18296 KB Output is correct
35 Correct 1559 ms 18160 KB Output is correct
36 Correct 1554 ms 18296 KB Output is correct
37 Correct 1554 ms 18296 KB Output is correct
38 Correct 1562 ms 18424 KB Output is correct
39 Correct 19 ms 3064 KB Output is correct
40 Correct 19 ms 3064 KB Output is correct
41 Correct 20 ms 3192 KB Output is correct
42 Correct 20 ms 3064 KB Output is correct
43 Correct 21 ms 3064 KB Output is correct
44 Correct 21 ms 3068 KB Output is correct
45 Correct 21 ms 3064 KB Output is correct
46 Correct 23 ms 3064 KB Output is correct
47 Correct 21 ms 3064 KB Output is correct
48 Correct 21 ms 3064 KB Output is correct
49 Correct 20 ms 3064 KB Output is correct
50 Correct 19 ms 3060 KB Output is correct
51 Correct 20 ms 3064 KB Output is correct
52 Correct 20 ms 3064 KB Output is correct
53 Correct 20 ms 3068 KB Output is correct
54 Correct 14 ms 2300 KB Output is correct
55 Correct 14 ms 2168 KB Output is correct
56 Correct 14 ms 2224 KB Output is correct
57 Correct 14 ms 2172 KB Output is correct
58 Correct 14 ms 2168 KB Output is correct
59 Correct 1681 ms 18172 KB Output is correct
60 Correct 1715 ms 18424 KB Output is correct
61 Correct 1688 ms 18168 KB Output is correct
62 Correct 1706 ms 18328 KB Output is correct
63 Correct 1691 ms 18296 KB Output is correct
64 Correct 1866 ms 18296 KB Output is correct
65 Correct 1850 ms 18296 KB Output is correct
66 Correct 1861 ms 18296 KB Output is correct
67 Correct 1848 ms 18424 KB Output is correct
68 Correct 1872 ms 18212 KB Output is correct
69 Correct 1743 ms 18300 KB Output is correct
70 Correct 1742 ms 18260 KB Output is correct
71 Correct 1747 ms 18296 KB Output is correct
72 Correct 1770 ms 18216 KB Output is correct
73 Correct 1725 ms 18296 KB Output is correct
74 Correct 319 ms 7268 KB Output is correct
75 Correct 328 ms 7296 KB Output is correct
76 Correct 325 ms 7244 KB Output is correct
77 Correct 325 ms 7160 KB Output is correct
78 Correct 320 ms 7160 KB Output is correct