oj.uz

Submission #793051

# Submission time Handle Problem Language Result Execution time Memory
793051 2023-07-25T13:01:59 Z algorithm16 Boat (APIO16_boat) C++14
100 / 100
 1606 ms 15188 KB 
#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
int n,a[505],b[505],dp[1505][2][505][2],inv[505],m[1505][505],mod=1e9+7;
vector <int> v,v1;
vector <vector<int> > v2;
int sum(int a,int b) {
	return (a+b)%mod;
}
int mul(int a,int b) {
	return ((long long)a*b)%mod;
}
int exp(int a,int b) {
	if(!b) return 1;
	int ret=exp(a,b/2);
	if(b%2==0) return mul(ret,ret);
	return mul(mul(ret,ret),a);
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	for(int i=0;i<n;i++) {
		cin >> a[i] >> b[i];
		v.push_back(a[i]);
		v.push_back(b[i]);
		v.push_back(b[i]+1);
	}
	sort(v.begin(),v.end());
	v.erase(unique(v.begin(),v.end()),v.end());
	/*for(int i=0;i<v.size()-1;i++) {
		cout << v[i] << " " << v[i+1]-1 << "\n";
	}*/
	/*for(int i=0;i<n;i++) {
		a[i]=lower_bound(v.begin(),v.end(),a[i])-v.begin();
		b[i]=lower_bound(v.begin(),v.end(),b[i])-v.begin();
	}*/
	for(int i=1;i<=n;i++) {
		inv[i]=exp(i,mod-2);
	}
	for(int i=0;i<v.size()-1;i++) {
		for(int j=0;j<=n;j++) {
			dp[i][n%2][j][0]=1;
			dp[i][n%2][j][1]=1;
		}
	}
	for(int i=0;i<v.size()-1;i++) {
		for(int j=0;j<n;j++) {
			m[i][j]=mul(v[i+1]-v[i]-j,inv[j+1]);
		}
	}
	for(int x=n-1;x>=0;x--) {
		for(int idx=v.size()-2;idx>=0;idx--) {
			for(int cnt=0;cnt<=x;cnt++) {
				for(int a1=0;a1<2;a1++) {
					int ret=0;
					if(!a1) ret=dp[idx][(x+1)%2][cnt][0]; // 0
					if(v[idx]>=a[x] && v[idx+1]-1<=b[x]) {
						if(cnt<=v[idx+1]-1-v[idx]) ret+=mul(dp[idx][(x+1)%2][cnt+1][0],m[idx][cnt]);
					}
					if(ret>=mod) ret-=mod;
					ret+=dp[idx+1][x%2][0][1];
					if(ret>=mod) ret-=mod;
					dp[idx][x%2][cnt][a1]=ret;
					//cout << idx << " " << x << " " << cnt << " " << a1 << "  " << ret << "\n";
				}
			}
		}
	}
	cout << dp[0][0][0][0]-1;
	return 0;
}

Compilation message

boat.cpp: In function 'int main()':
boat.cpp:44:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |  for(int i=0;i<v.size()-1;i++) {
      |              ~^~~~~~~~~~~
boat.cpp:50:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |  for(int i=0;i<v.size()-1;i++) {
      |              ~^~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 442 ms 10228 KB Output is correct
2 Correct 442 ms 10224 KB Output is correct
3 Correct 420 ms 10228 KB Output is correct
4 Correct 459 ms 10228 KB Output is correct
5 Correct 412 ms 10228 KB Output is correct
6 Correct 448 ms 10228 KB Output is correct
7 Correct 412 ms 10228 KB Output is correct
8 Correct 458 ms 10228 KB Output is correct
9 Correct 405 ms 10196 KB Output is correct
10 Correct 416 ms 10232 KB Output is correct
11 Correct 415 ms 10228 KB Output is correct
12 Correct 419 ms 10236 KB Output is correct
13 Correct 402 ms 10228 KB Output is correct
14 Correct 413 ms 10196 KB Output is correct
15 Correct 401 ms 10228 KB Output is correct
16 Correct 71 ms 2004 KB Output is correct
17 Correct 88 ms 2236 KB Output is correct
18 Correct 75 ms 2144 KB Output is correct
19 Correct 78 ms 2160 KB Output is correct
20 Correct 78 ms 2132 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 442 ms 10228 KB Output is correct
2 Correct 442 ms 10224 KB Output is correct
3 Correct 420 ms 10228 KB Output is correct
4 Correct 459 ms 10228 KB Output is correct
5 Correct 412 ms 10228 KB Output is correct
6 Correct 448 ms 10228 KB Output is correct
7 Correct 412 ms 10228 KB Output is correct
8 Correct 458 ms 10228 KB Output is correct
9 Correct 405 ms 10196 KB Output is correct
10 Correct 416 ms 10232 KB Output is correct
11 Correct 415 ms 10228 KB Output is correct
12 Correct 419 ms 10236 KB Output is correct
13 Correct 402 ms 10228 KB Output is correct
14 Correct 413 ms 10196 KB Output is correct
15 Correct 401 ms 10228 KB Output is correct
16 Correct 71 ms 2004 KB Output is correct
17 Correct 88 ms 2236 KB Output is correct
18 Correct 75 ms 2144 KB Output is correct
19 Correct 78 ms 2160 KB Output is correct
20 Correct 78 ms 2132 KB Output is correct
21 Correct 607 ms 13176 KB Output is correct
22 Correct 638 ms 13304 KB Output is correct
23 Correct 554 ms 13020 KB Output is correct
24 Correct 577 ms 13124 KB Output is correct
25 Correct 586 ms 13012 KB Output is correct
26 Correct 552 ms 12296 KB Output is correct
27 Correct 559 ms 12640 KB Output is correct
28 Correct 596 ms 12404 KB Output is correct
29 Correct 546 ms 12472 KB Output is correct
30 Correct 597 ms 14676 KB Output is correct
31 Correct 616 ms 14596 KB Output is correct
32 Correct 605 ms 14612 KB Output is correct
33 Correct 609 ms 14636 KB Output is correct
34 Correct 628 ms 14568 KB Output is correct
35 Correct 408 ms 10220 KB Output is correct
36 Correct 408 ms 10212 KB Output is correct
37 Correct 421 ms 10216 KB Output is correct
38 Correct 401 ms 10200 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 3284 KB Output is correct
2 Correct 11 ms 3284 KB Output is correct
3 Correct 12 ms 3284 KB Output is correct
4 Correct 11 ms 3292 KB Output is correct
5 Correct 14 ms 3292 KB Output is correct
6 Correct 14 ms 3284 KB Output is correct
7 Correct 14 ms 3240 KB Output is correct
8 Correct 14 ms 3292 KB Output is correct
9 Correct 14 ms 3276 KB Output is correct
10 Correct 14 ms 3284 KB Output is correct
11 Correct 11 ms 3288 KB Output is correct
12 Correct 12 ms 3288 KB Output is correct
13 Correct 10 ms 3292 KB Output is correct
14 Correct 12 ms 3292 KB Output is correct
15 Correct 11 ms 3284 KB Output is correct
16 Correct 6 ms 1748 KB Output is correct
17 Correct 5 ms 1620 KB Output is correct
18 Correct 5 ms 1612 KB Output is correct
19 Correct 5 ms 1620 KB Output is correct
20 Correct 6 ms 1748 KB Output is correct

Subtask #4
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 442 ms 10228 KB Output is correct
2 Correct 442 ms 10224 KB Output is correct
3 Correct 420 ms 10228 KB Output is correct
4 Correct 459 ms 10228 KB Output is correct
5 Correct 412 ms 10228 KB Output is correct
6 Correct 448 ms 10228 KB Output is correct
7 Correct 412 ms 10228 KB Output is correct
8 Correct 458 ms 10228 KB Output is correct
9 Correct 405 ms 10196 KB Output is correct
10 Correct 416 ms 10232 KB Output is correct
11 Correct 415 ms 10228 KB Output is correct
12 Correct 419 ms 10236 KB Output is correct
13 Correct 402 ms 10228 KB Output is correct
14 Correct 413 ms 10196 KB Output is correct
15 Correct 401 ms 10228 KB Output is correct
16 Correct 71 ms 2004 KB Output is correct
17 Correct 88 ms 2236 KB Output is correct
18 Correct 75 ms 2144 KB Output is correct
19 Correct 78 ms 2160 KB Output is correct
20 Correct 78 ms 2132 KB Output is correct
21 Correct 607 ms 13176 KB Output is correct
22 Correct 638 ms 13304 KB Output is correct
23 Correct 554 ms 13020 KB Output is correct
24 Correct 577 ms 13124 KB Output is correct
25 Correct 586 ms 13012 KB Output is correct
26 Correct 552 ms 12296 KB Output is correct
27 Correct 559 ms 12640 KB Output is correct
28 Correct 596 ms 12404 KB Output is correct
29 Correct 546 ms 12472 KB Output is correct
30 Correct 597 ms 14676 KB Output is correct
31 Correct 616 ms 14596 KB Output is correct
32 Correct 605 ms 14612 KB Output is correct
33 Correct 609 ms 14636 KB Output is correct
34 Correct 628 ms 14568 KB Output is correct
35 Correct 408 ms 10220 KB Output is correct
36 Correct 408 ms 10212 KB Output is correct
37 Correct 421 ms 10216 KB Output is correct
38 Correct 401 ms 10200 KB Output is correct
39 Correct 11 ms 3284 KB Output is correct
40 Correct 11 ms 3284 KB Output is correct
41 Correct 12 ms 3284 KB Output is correct
42 Correct 11 ms 3292 KB Output is correct
43 Correct 14 ms 3292 KB Output is correct
44 Correct 14 ms 3284 KB Output is correct
45 Correct 14 ms 3240 KB Output is correct
46 Correct 14 ms 3292 KB Output is correct
47 Correct 14 ms 3276 KB Output is correct
48 Correct 14 ms 3284 KB Output is correct
49 Correct 11 ms 3288 KB Output is correct
50 Correct 12 ms 3288 KB Output is correct
51 Correct 10 ms 3292 KB Output is correct
52 Correct 12 ms 3292 KB Output is correct
53 Correct 11 ms 3284 KB Output is correct
54 Correct 6 ms 1748 KB Output is correct
55 Correct 5 ms 1620 KB Output is correct
56 Correct 5 ms 1612 KB Output is correct
57 Correct 5 ms 1620 KB Output is correct
58 Correct 6 ms 1748 KB Output is correct
59 Correct 1328 ms 15156 KB Output is correct
60 Correct 1273 ms 15152 KB Output is correct
61 Correct 1253 ms 15152 KB Output is correct
62 Correct 1300 ms 15156 KB Output is correct
63 Correct 1273 ms 15152 KB Output is correct
64 Correct 1541 ms 15160 KB Output is correct
65 Correct 1579 ms 15172 KB Output is correct
66 Correct 1565 ms 15156 KB Output is correct
67 Correct 1573 ms 15188 KB Output is correct
68 Correct 1606 ms 15160 KB Output is correct
69 Correct 1130 ms 15152 KB Output is correct
70 Correct 1122 ms 15160 KB Output is correct
71 Correct 1116 ms 15160 KB Output is correct
72 Correct 1146 ms 15152 KB Output is correct
73 Correct 1204 ms 15152 KB Output is correct
74 Correct 162 ms 2260 KB Output is correct
75 Correct 138 ms 2264 KB Output is correct
76 Correct 139 ms 2132 KB Output is correct
77 Correct 164 ms 2260 KB Output is correct
78 Correct 144 ms 2240 KB Output is correct