oj.uz

Submission #754825

# Submission time Handle Problem Language Result Execution time Memory
754825 2023-06-08T16:57:01 Z denniskim Boat (APIO16_boat) C++17
100 / 100
 1839 ms 16284 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")

using namespace std;
typedef long long ll;
typedef __int128 lll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
#define MAX 9223372036854775807LL
#define MIN -9223372036854775807LL
#define INF 0x3f3f3f3f3f3f3f3f
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout << fixed; cout.precision(10);
#define sp << " "
#define en << "\n"
#define compress(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(), v.end()), v.end())

ll n;
pll a[1010];
ll ss = 1000000007;
ll inv[1010];
vector<ll> zip;
ll dp[1010][1010];
ll sum[1010][1010];
ll LC[1010];
ll xjc[1010];
ll num[1010];

ll sqrmtp(ll X, ll Y)
{
	ll ret = 1;
	
	while(Y)
	{
		if(Y & 1)
			ret = ret * X % ss;
		
		X = X * X % ss;
		Y >>= 1;
	}
	
	return ret;
}

int main(void)
{
	fastio
	
	cin >> n;
	
	for(ll i = 1 ; i <= n ; ++i)
	{
		cin >> a[i].fi >> a[i].se;
		
		zip.push_back(a[i].fi);
		zip.push_back(a[i].se + 1);
	}
	
	for(ll i = 1 ; i <= n ; ++i)
		inv[i] = sqrmtp(i, ss - 2);
	
	compress(zip);
	
	dp[0][0] = 1;
	sum[0][0] = 1;
	
	for(ll i = 1 ; i <= n ; ++i)
		sum[0][i] = 1;
	
	ll siz = (ll)zip.size();
	
	for(ll i = 1 ; i < siz ; ++i)
	{
		ll siz2 = 0;
		
		for(ll j = 1 ; j <= n ; ++j)
		{
			if(a[j].fi <= zip[i - 1] && zip[i] - 1 <= a[j].se)
				num[siz2++] = j;
		}
		
		ll L = zip[i] - zip[i - 1];
		LC[0] = 1;
		
		for(ll j = 1 ; j <= n ; ++j)
		{
			if(L <= 0)
				break;
			
			LC[j] = LC[j - 1] * L % ss * inv[j] % ss;
			L--;
		}
		
		L = zip[i] - zip[i - 1];
		
		for(ll j = 0 ; j <= siz2 - 2 ; ++j)
		{
			ll gap = j;
			ll gap2 = 1;
			
			xjc[j] = 0;
			
			if(L <= 1)
				break;
			
			xjc[j] = LC[2];
			
			for(ll k = 1 ; ; ++k)
			{
				if(k + 2 > L || k > j)
					break;
				
				gap2 = gap2 * gap % ss * inv[k] % ss;
				gap--;
				xjc[j] = (xjc[j] + gap2 * LC[k + 2] % ss) % ss;
			}
		}
		
		for(ll j = 0 ; j < siz2 ; ++j)
		{
			dp[i][num[j]] = (dp[i][num[j]] + sum[i - 1][num[j] - 1] * LC[1] % ss) % ss;
			
			if(L >= 2)
			{
				for(ll k = 0 ; k < j ; ++k)
					dp[i][num[j]] = (dp[i][num[j]] + sum[i - 1][num[k] - 1] * xjc[j - k - 1] % ss) % ss;
			}
		}
		
		for(ll j = 0 ; j <= n ; ++j)
			dp[i][j] = (dp[i][j] + dp[i - 1][j]) % ss;
		
		sum[i][0] = dp[i][0];
		
		for(ll j = 1 ; j <= n ; ++j)
			sum[i][j] = (sum[i][j - 1] + dp[i][j]) % ss;
	}
	
	sum[siz - 1][n]--;
	sum[siz - 1][n] = (sum[siz - 1][n] % ss + ss) % ss;
	
	cout << sum[siz - 1][n];
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 16084 KB Output is correct
2 Correct 20 ms 16128 KB Output is correct
3 Correct 19 ms 16076 KB Output is correct
4 Correct 18 ms 16124 KB Output is correct
5 Correct 19 ms 16056 KB Output is correct
6 Correct 19 ms 16136 KB Output is correct
7 Correct 18 ms 16084 KB Output is correct
8 Correct 18 ms 16092 KB Output is correct
9 Correct 20 ms 16084 KB Output is correct
10 Correct 19 ms 16084 KB Output is correct
11 Correct 17 ms 16084 KB Output is correct
12 Correct 18 ms 16116 KB Output is correct
13 Correct 18 ms 16084 KB Output is correct
14 Correct 18 ms 16084 KB Output is correct
15 Correct 18 ms 16084 KB Output is correct
16 Correct 5 ms 3156 KB Output is correct
17 Correct 4 ms 3284 KB Output is correct
18 Correct 4 ms 3156 KB Output is correct
19 Correct 4 ms 3304 KB Output is correct
20 Correct 4 ms 3164 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 16084 KB Output is correct
2 Correct 20 ms 16128 KB Output is correct
3 Correct 19 ms 16076 KB Output is correct
4 Correct 18 ms 16124 KB Output is correct
5 Correct 19 ms 16056 KB Output is correct
6 Correct 19 ms 16136 KB Output is correct
7 Correct 18 ms 16084 KB Output is correct
8 Correct 18 ms 16092 KB Output is correct
9 Correct 20 ms 16084 KB Output is correct
10 Correct 19 ms 16084 KB Output is correct
11 Correct 17 ms 16084 KB Output is correct
12 Correct 18 ms 16116 KB Output is correct
13 Correct 18 ms 16084 KB Output is correct
14 Correct 18 ms 16084 KB Output is correct
15 Correct 18 ms 16084 KB Output is correct
16 Correct 5 ms 3156 KB Output is correct
17 Correct 4 ms 3284 KB Output is correct
18 Correct 4 ms 3156 KB Output is correct
19 Correct 4 ms 3304 KB Output is correct
20 Correct 4 ms 3164 KB Output is correct
21 Correct 180 ms 14704 KB Output is correct
22 Correct 168 ms 14960 KB Output is correct
23 Correct 154 ms 14592 KB Output is correct
24 Correct 176 ms 14472 KB Output is correct
25 Correct 177 ms 14540 KB Output is correct
26 Correct 341 ms 14288 KB Output is correct
27 Correct 339 ms 14436 KB Output is correct
28 Correct 359 ms 14160 KB Output is correct
29 Correct 372 ms 14168 KB Output is correct
30 Correct 19 ms 16084 KB Output is correct
31 Correct 18 ms 16084 KB Output is correct
32 Correct 18 ms 16084 KB Output is correct
33 Correct 16 ms 16024 KB Output is correct
34 Correct 17 ms 16096 KB Output is correct
35 Correct 17 ms 16084 KB Output is correct
36 Correct 18 ms 16084 KB Output is correct
37 Correct 20 ms 16084 KB Output is correct
38 Correct 18 ms 16084 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 16084 KB Output is correct
2 Correct 20 ms 16128 KB Output is correct
3 Correct 19 ms 16076 KB Output is correct
4 Correct 18 ms 16124 KB Output is correct
5 Correct 19 ms 16056 KB Output is correct
6 Correct 19 ms 16136 KB Output is correct
7 Correct 18 ms 16084 KB Output is correct
8 Correct 18 ms 16092 KB Output is correct
9 Correct 20 ms 16084 KB Output is correct
10 Correct 19 ms 16084 KB Output is correct
11 Correct 17 ms 16084 KB Output is correct
12 Correct 18 ms 16116 KB Output is correct
13 Correct 18 ms 16084 KB Output is correct
14 Correct 18 ms 16084 KB Output is correct
15 Correct 18 ms 16084 KB Output is correct
16 Correct 5 ms 3156 KB Output is correct
17 Correct 4 ms 3284 KB Output is correct
18 Correct 4 ms 3156 KB Output is correct
19 Correct 4 ms 3304 KB Output is correct
20 Correct 4 ms 3164 KB Output is correct
21 Correct 180 ms 14704 KB Output is correct
22 Correct 168 ms 14960 KB Output is correct
23 Correct 154 ms 14592 KB Output is correct
24 Correct 176 ms 14472 KB Output is correct
25 Correct 177 ms 14540 KB Output is correct
26 Correct 341 ms 14288 KB Output is correct
27 Correct 339 ms 14436 KB Output is correct
28 Correct 359 ms 14160 KB Output is correct
29 Correct 372 ms 14168 KB Output is correct
30 Correct 19 ms 16084 KB Output is correct
31 Correct 18 ms 16084 KB Output is correct
32 Correct 18 ms 16084 KB Output is correct
33 Correct 16 ms 16024 KB Output is correct
34 Correct 17 ms 16096 KB Output is correct
35 Correct 17 ms 16084 KB Output is correct
36 Correct 18 ms 16084 KB Output is correct
37 Correct 20 ms 16084 KB Output is correct
38 Correct 18 ms 16084 KB Output is correct
39 Correct 7 ms 2260 KB Output is correct
40 Correct 5 ms 2260 KB Output is correct
41 Correct 6 ms 2260 KB Output is correct
42 Correct 7 ms 2216 KB Output is correct
43 Correct 8 ms 2260 KB Output is correct
44 Correct 16 ms 2176 KB Output is correct
45 Correct 15 ms 2276 KB Output is correct
46 Correct 15 ms 2216 KB Output is correct
47 Correct 14 ms 2260 KB Output is correct
48 Correct 15 ms 2260 KB Output is correct
49 Correct 7 ms 2260 KB Output is correct
50 Correct 6 ms 2260 KB Output is correct
51 Correct 7 ms 2260 KB Output is correct
52 Correct 7 ms 2260 KB Output is correct
53 Correct 8 ms 2260 KB Output is correct
54 Correct 4 ms 1364 KB Output is correct
55 Correct 3 ms 1364 KB Output is correct
56 Correct 3 ms 1364 KB Output is correct
57 Correct 3 ms 1364 KB Output is correct
58 Correct 4 ms 1364 KB Output is correct
59 Correct 751 ms 16072 KB Output is correct
60 Correct 670 ms 16124 KB Output is correct
61 Correct 663 ms 16208 KB Output is correct
62 Correct 805 ms 16116 KB Output is correct
63 Correct 729 ms 16100 KB Output is correct
64 Correct 1839 ms 16188 KB Output is correct
65 Correct 1763 ms 16072 KB Output is correct
66 Correct 1772 ms 16076 KB Output is correct
67 Correct 1730 ms 16184 KB Output is correct
68 Correct 1734 ms 16284 KB Output is correct
69 Correct 673 ms 16168 KB Output is correct
70 Correct 650 ms 16160 KB Output is correct
71 Correct 658 ms 16120 KB Output is correct
72 Correct 684 ms 16248 KB Output is correct
73 Correct 713 ms 16080 KB Output is correct
74 Correct 79 ms 3136 KB Output is correct
75 Correct 73 ms 3276 KB Output is correct
76 Correct 75 ms 3196 KB Output is correct
77 Correct 75 ms 3236 KB Output is correct
78 Correct 78 ms 3164 KB Output is correct