oj.uz

Submission #1106249

# Submission time Handle Problem Language Result Execution time Memory
1106249 2024-10-29T16:25:47 Z _rain_ Boat (APIO16_boat) C++14
58 / 100
 2000 ms 14012 KB 
#include<bits/stdc++.h>
using namespace std;
 
typedef long long ll ;
typedef pair<int,int> ii;
#define fi first
#define se second
#define name "main"
 
const int N=(int)2000;
const int MOD=(int)1e9+7;
	int add(int a,int b){
		return a+b>=MOD?a+b-MOD:a+b;
	}
	int sub(int a,int b){
		return a-b<0?a-b+MOD:a-b;
	}
	int mul(int a,int b){
		return (ll)a*b%MOD;
	}
	int power(int a,int b){
		int res=1;
		for(;b;b>>=1,a=mul(a,a))
			if (b&1) res=mul(res,a);
		return res;
	}
vector<int>nen;
vector<ii>line;
int a[N+2],b[N+2],n;
int L[N+2]={},R[N+2]={},f[N+2][2*N+2]={},dp[N+2][2*N+2]={};
int sing[N+2]={},fact[N+2]={},inv[N+2]={},w[N+2]={};
int Combine(int x,int y){
	if (x>y) return 0;
	return (ll)fact[y]*inv[y-x]%MOD*inv[x]%MOD;
}

int C(int k,int n){
	if (k>n) return 0;
	int res=1;
	for(int i=n-k+1;i<=n;++i) res=mul(res,i);
	return mul(res,inv[k]);
}
bool intersec(ii x,int a,int b){
	if (b<x.fi||a>x.se) return false;
	return true;
}
 
void build(){
	memset(L,0x3f,sizeof L);
	memset(R,-0x3f,sizeof R);
	fact[0]=1;
	for(int i=1;i<=N;++i) fact[i]=mul(fact[i-1],i);
	inv[N]=power(fact[N],MOD-2);
	for(int i=N;i>=1;--i) inv[i-1]=mul(inv[i],i);
	for(int id=1;id<=line.size();++id){
		int dodai=line[id-1].se-line[id-1].fi+1;
		for(int j=1;j<=n;++j) w[j]=C(j,dodai);
		for(int j=1;j<=n;++j){
			for(int c=1;c<=j;++c)
				f[id][j]=add(f[id][j],mul(Combine(c-1,j-1),w[c]));
		}
	}
	for(int i=1;i<=n;++i){
		for(int j=1;j<=line.size();++j){
			if (intersec(line[j-1],a[i],b[i])) 
				L[i]=min(L[i],j),R[i]=max(R[i],j);
		}
	}
	return;
}
 
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	// freopen(name".inp","r",stdin);
	// freopen(name".out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;++i){
		cin>>a[i]>>b[i];
		nen.push_back(a[i]);
		nen.push_back(b[i]);
		nen.push_back(a[i]-1);
	}
	sort(nen.begin(),nen.end());
	nen.resize(unique(nen.begin(),nen.end())-nen.begin());
	for(int i=1;i<nen.size();++i){
		if (i-1==0) line.push_back({nen[i-1],nen[i]});
		else line.push_back({nen[i-1]+1,nen[i]});
	}
	build();
	for(int i=0;i<=line.size();++i) dp[0][i]=1;
	for(int i=1;i<=n;++i){
		// cout<<i<<'\n';
		for(int id=L[i];id<=R[i];++id){
			int cnt=0;
			pair<int,int> xx=line[id-1];
			if (id==L[i]){
				int dodai=line[id-1].se-a[i]+1;
				for(int j=0;j<=n;++j) sing[j]=0;
				for(int j=1;j<=n;++j) w[j]=C(j,dodai);
				for(int j=1;j<=n;++j){
					for(int c=1;c<=j;++c)
						sing[j]=add(sing[j],mul(Combine(c-1,j),w[c]));
				}
				xx={a[i],line[id-1].se};
			}
			for(int j=i;j>=1;--j){
				if (intersec(xx,a[j],b[j])) ++cnt;
				if (id==L[i]) dp[i][id]=add(dp[i][id],mul(sing[cnt],dp[j-1][id-1]));
				else dp[i][id]=add(dp[i][id],mul(f[id][cnt],dp[j-1][id-1]));
			}
		}
		for(int j=1;j<=line.size();++j) dp[i][j]=add(dp[i][j],dp[i][j-1]);
	}
	int ans=0;
	for(int i=1;i<=n;++i) ans=add(ans,dp[i][line.size()]);
	cout<<ans;
	exit(0);
}

Compilation message

boat.cpp: In function 'void build()':
boat.cpp:55:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |  for(int id=1;id<=line.size();++id){
      |               ~~^~~~~~~~~~~~~
boat.cpp:64:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |   for(int j=1;j<=line.size();++j){
      |               ~^~~~~~~~~~~~~
boat.cpp: In function 'int32_t main()':
boat.cpp:86:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |  for(int i=1;i<nen.size();++i){
      |              ~^~~~~~~~~~~
boat.cpp:91:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |  for(int i=0;i<=line.size();++i) dp[0][i]=1;
      |              ~^~~~~~~~~~~~~
boat.cpp:113:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |   for(int j=1;j<=line.size();++j) dp[i][j]=add(dp[i][j],dp[i][j-1]);
      |               ~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1355 ms 10428 KB Output is correct
2 Correct 1357 ms 10428 KB Output is correct
3 Correct 1358 ms 10464 KB Output is correct
4 Correct 1358 ms 10316 KB Output is correct
5 Correct 1350 ms 10312 KB Output is correct
6 Correct 1361 ms 10344 KB Output is correct
7 Correct 1358 ms 10312 KB Output is correct
8 Correct 1363 ms 10420 KB Output is correct
9 Correct 1356 ms 10320 KB Output is correct
10 Correct 1368 ms 10316 KB Output is correct
11 Correct 1355 ms 10312 KB Output is correct
12 Correct 1362 ms 10452 KB Output is correct
13 Correct 1359 ms 10288 KB Output is correct
14 Correct 1360 ms 10408 KB Output is correct
15 Correct 1366 ms 10248 KB Output is correct
16 Correct 537 ms 3916 KB Output is correct
17 Correct 554 ms 3912 KB Output is correct
18 Correct 551 ms 3916 KB Output is correct
19 Correct 558 ms 3920 KB Output is correct
20 Correct 551 ms 3912 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1355 ms 10428 KB Output is correct
2 Correct 1357 ms 10428 KB Output is correct
3 Correct 1358 ms 10464 KB Output is correct
4 Correct 1358 ms 10316 KB Output is correct
5 Correct 1350 ms 10312 KB Output is correct
6 Correct 1361 ms 10344 KB Output is correct
7 Correct 1358 ms 10312 KB Output is correct
8 Correct 1363 ms 10420 KB Output is correct
9 Correct 1356 ms 10320 KB Output is correct
10 Correct 1368 ms 10316 KB Output is correct
11 Correct 1355 ms 10312 KB Output is correct
12 Correct 1362 ms 10452 KB Output is correct
13 Correct 1359 ms 10288 KB Output is correct
14 Correct 1360 ms 10408 KB Output is correct
15 Correct 1366 ms 10248 KB Output is correct
16 Correct 537 ms 3916 KB Output is correct
17 Correct 554 ms 3912 KB Output is correct
18 Correct 551 ms 3916 KB Output is correct
19 Correct 558 ms 3920 KB Output is correct
20 Correct 551 ms 3912 KB Output is correct
21 Correct 1506 ms 12704 KB Output is correct
22 Correct 1495 ms 12804 KB Output is correct
23 Correct 1437 ms 12780 KB Output is correct
24 Correct 1466 ms 12736 KB Output is correct
25 Correct 1452 ms 12660 KB Output is correct
26 Correct 1463 ms 12268 KB Output is correct
27 Correct 1470 ms 12312 KB Output is correct
28 Correct 1478 ms 12128 KB Output is correct
29 Correct 1461 ms 12104 KB Output is correct
30 Correct 1639 ms 13972 KB Output is correct
31 Correct 1624 ms 14012 KB Output is correct
32 Correct 1633 ms 13896 KB Output is correct
33 Correct 1642 ms 14012 KB Output is correct
34 Correct 1633 ms 13896 KB Output is correct
35 Correct 1310 ms 10428 KB Output is correct
36 Correct 1328 ms 10228 KB Output is correct
37 Correct 1325 ms 10292 KB Output is correct
38 Correct 1326 ms 10388 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2128 KB Output is correct
2 Correct 20 ms 2128 KB Output is correct
3 Correct 19 ms 2132 KB Output is correct
4 Correct 20 ms 2112 KB Output is correct
5 Correct 20 ms 2244 KB Output is correct
6 Correct 20 ms 2128 KB Output is correct
7 Correct 20 ms 2128 KB Output is correct
8 Correct 20 ms 2356 KB Output is correct
9 Correct 21 ms 2168 KB Output is correct
10 Correct 20 ms 2128 KB Output is correct
11 Correct 19 ms 2144 KB Output is correct
12 Correct 19 ms 2224 KB Output is correct
13 Correct 19 ms 2128 KB Output is correct
14 Correct 19 ms 2128 KB Output is correct
15 Correct 19 ms 2196 KB Output is correct
16 Correct 11 ms 1360 KB Output is correct
17 Correct 12 ms 1360 KB Output is correct
18 Correct 11 ms 1784 KB Output is correct
19 Correct 11 ms 1616 KB Output is correct
20 Correct 11 ms 1360 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1355 ms 10428 KB Output is correct
2 Correct 1357 ms 10428 KB Output is correct
3 Correct 1358 ms 10464 KB Output is correct
4 Correct 1358 ms 10316 KB Output is correct
5 Correct 1350 ms 10312 KB Output is correct
6 Correct 1361 ms 10344 KB Output is correct
7 Correct 1358 ms 10312 KB Output is correct
8 Correct 1363 ms 10420 KB Output is correct
9 Correct 1356 ms 10320 KB Output is correct
10 Correct 1368 ms 10316 KB Output is correct
11 Correct 1355 ms 10312 KB Output is correct
12 Correct 1362 ms 10452 KB Output is correct
13 Correct 1359 ms 10288 KB Output is correct
14 Correct 1360 ms 10408 KB Output is correct
15 Correct 1366 ms 10248 KB Output is correct
16 Correct 537 ms 3916 KB Output is correct
17 Correct 554 ms 3912 KB Output is correct
18 Correct 551 ms 3916 KB Output is correct
19 Correct 558 ms 3920 KB Output is correct
20 Correct 551 ms 3912 KB Output is correct
21 Correct 1506 ms 12704 KB Output is correct
22 Correct 1495 ms 12804 KB Output is correct
23 Correct 1437 ms 12780 KB Output is correct
24 Correct 1466 ms 12736 KB Output is correct
25 Correct 1452 ms 12660 KB Output is correct
26 Correct 1463 ms 12268 KB Output is correct
27 Correct 1470 ms 12312 KB Output is correct
28 Correct 1478 ms 12128 KB Output is correct
29 Correct 1461 ms 12104 KB Output is correct
30 Correct 1639 ms 13972 KB Output is correct
31 Correct 1624 ms 14012 KB Output is correct
32 Correct 1633 ms 13896 KB Output is correct
33 Correct 1642 ms 14012 KB Output is correct
34 Correct 1633 ms 13896 KB Output is correct
35 Correct 1310 ms 10428 KB Output is correct
36 Correct 1328 ms 10228 KB Output is correct
37 Correct 1325 ms 10292 KB Output is correct
38 Correct 1326 ms 10388 KB Output is correct
39 Correct 22 ms 2128 KB Output is correct
40 Correct 20 ms 2128 KB Output is correct
41 Correct 19 ms 2132 KB Output is correct
42 Correct 20 ms 2112 KB Output is correct
43 Correct 20 ms 2244 KB Output is correct
44 Correct 20 ms 2128 KB Output is correct
45 Correct 20 ms 2128 KB Output is correct
46 Correct 20 ms 2356 KB Output is correct
47 Correct 21 ms 2168 KB Output is correct
48 Correct 20 ms 2128 KB Output is correct
49 Correct 19 ms 2144 KB Output is correct
50 Correct 19 ms 2224 KB Output is correct
51 Correct 19 ms 2128 KB Output is correct
52 Correct 19 ms 2128 KB Output is correct
53 Correct 19 ms 2196 KB Output is correct
54 Correct 11 ms 1360 KB Output is correct
55 Correct 12 ms 1360 KB Output is correct
56 Correct 11 ms 1784 KB Output is correct
57 Correct 11 ms 1616 KB Output is correct
58 Correct 11 ms 1360 KB Output is correct
59 Execution timed out 2062 ms 12916 KB Time limit exceeded
60 Halted 0 ms 0 KB -