oj.uz

Submission #533889

# Submission time Handle Problem Language Result Execution time Memory
533889 2022-03-07T14:55:13 Z new_acc Boat (APIO16_boat) C++14
58 / 100
 2000 ms 21516 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=5e2+10;
const ll mod=1e9+7;
struct st{
	int a,b,dl;
};
st pw[N*2];
ll dp[N][N*2];
ll dp2[N*2][N];
ll dp3[N*2][N];
pair<int,int>w[N];
ll sil[N],sp[N][N*2];
ll d1[N][N],d2[N*2][N];
ll power(ll n,ll k){
	ll res=1;
	while(k>0){
		if(k&1) (res*=n)%=mod;
		k>>=1;
		(n*=n)%=mod;
	}
	return res;
}
ll dwu(ll n,ll k){
	if(k>n) return 0;
	ll curr=1;
	for(int i=n;i>=n-k+1;i--) (curr*=(ll)i)%=mod;
	return (curr*power(sil[k],mod-2))%mod;
}
void solve(){
	int n;
	cin>>n;
	vi v;
	for(int i=1;i<=n;i++){
		cin>>w[i].fi>>w[i].se;
		v.push_back(w[i].fi),v.push_back(w[i].se+1);
	}
	sort(v.begin(),v.end());
	int l=0;
	for(int i=0;i<v.size()-1;i++){
		if(v[i]==v[i+1]) continue;
		st pom;
		pom.a=v[i],pom.b=v[i+1]-1,pom.dl=(pom.b-pom.a+1);
		pw[++l]=pom;
	}
	sil[0]=1;
	for(int i=1;i<=n;i++) (sil[i]=sil[i-1]*(ll)i)%=mod;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=i;j++) d1[i][j]=dwu(i,j);
	for(int i=1;i<=l;i++)
		for(int j=1;j<=n;j++) d2[i][j]=dwu(pw[i].dl,j);
	for(int i=1;i<=l;i++){
		for(int j=1;j<=n;j++){
			dp2[i][j]=pw[i].dl;
			for(int k=min(j,pw[i].dl);k>=2;k--) (dp2[i][j]+=d1[j-1][k-1]*d2[i][k])%=mod;
		}
	}
	for(int i=1;i<=l;i++){
		for(int j=2;j<=n;j++){
			if(pw[i].dl==1) continue;
			dp3[i][j]=(ll)(pw[i].dl*(pw[i].dl-1LL))/2;
			dp3[i][j]%=mod;
			for(int k=min(j,pw[i].dl);k>=3;k--) (dp3[i][j]+=d1[j-2][k-2]*d2[i][k])%=mod;
		}
	}
	ll res=0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=l;j++){
			if(pw[j].b<w[i].fi or pw[j].a>w[i].se) continue;
			dp[i][j]=pw[j].dl;
			int il=1;
			for(int k=i-1;k>=1;k--){
				(dp[i][j]+=sp[k][j-1]*dp2[j][il])%=mod;
				if(pw[j].a>=w[k].fi and pw[j].b<=w[k].se){
					il++;
					(dp[i][j]+=dp3[j][il])%=mod;
				}
			}
			(res+=dp[i][j])%=mod;
		}
		for(int j=1;j<=l;j++) sp[i][j]=(sp[i][j-1]+dp[i][j])%mod;
	}
	cout<<res<<"\n";
}
int main(){
	ios_base::sync_with_stdio(0),cin.tie(0);
	solve();
}

Compilation message

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 884 ms 20240 KB Output is correct
2 Correct 898 ms 20132 KB Output is correct
3 Correct 892 ms 20152 KB Output is correct
4 Correct 898 ms 20216 KB Output is correct
5 Correct 893 ms 20084 KB Output is correct
6 Correct 884 ms 20172 KB Output is correct
7 Correct 889 ms 20300 KB Output is correct
8 Correct 895 ms 20180 KB Output is correct
9 Correct 908 ms 20172 KB Output is correct
10 Correct 892 ms 20220 KB Output is correct
11 Correct 893 ms 20252 KB Output is correct
12 Correct 897 ms 20248 KB Output is correct
13 Correct 892 ms 20172 KB Output is correct
14 Correct 893 ms 20340 KB Output is correct
15 Correct 920 ms 20304 KB Output is correct
16 Correct 247 ms 9028 KB Output is correct
17 Correct 251 ms 9324 KB Output is correct
18 Correct 255 ms 9156 KB Output is correct
19 Correct 249 ms 9284 KB Output is correct
20 Correct 253 ms 9188 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 884 ms 20240 KB Output is correct
2 Correct 898 ms 20132 KB Output is correct
3 Correct 892 ms 20152 KB Output is correct
4 Correct 898 ms 20216 KB Output is correct
5 Correct 893 ms 20084 KB Output is correct
6 Correct 884 ms 20172 KB Output is correct
7 Correct 889 ms 20300 KB Output is correct
8 Correct 895 ms 20180 KB Output is correct
9 Correct 908 ms 20172 KB Output is correct
10 Correct 892 ms 20220 KB Output is correct
11 Correct 893 ms 20252 KB Output is correct
12 Correct 897 ms 20248 KB Output is correct
13 Correct 892 ms 20172 KB Output is correct
14 Correct 893 ms 20340 KB Output is correct
15 Correct 920 ms 20304 KB Output is correct
16 Correct 247 ms 9028 KB Output is correct
17 Correct 251 ms 9324 KB Output is correct
18 Correct 255 ms 9156 KB Output is correct
19 Correct 249 ms 9284 KB Output is correct
20 Correct 253 ms 9188 KB Output is correct
21 Correct 375 ms 20304 KB Output is correct
22 Correct 382 ms 20096 KB Output is correct
23 Correct 360 ms 19940 KB Output is correct
24 Correct 379 ms 20016 KB Output is correct
25 Correct 376 ms 20200 KB Output is correct
26 Correct 510 ms 20276 KB Output is correct
27 Correct 515 ms 20508 KB Output is correct
28 Correct 522 ms 20284 KB Output is correct
29 Correct 510 ms 20280 KB Output is correct
30 Correct 831 ms 20284 KB Output is correct
31 Correct 851 ms 20272 KB Output is correct
32 Correct 858 ms 20240 KB Output is correct
33 Correct 845 ms 20196 KB Output is correct
34 Correct 823 ms 20276 KB Output is correct
35 Correct 839 ms 20152 KB Output is correct
36 Correct 826 ms 20236 KB Output is correct
37 Correct 849 ms 20152 KB Output is correct
38 Correct 832 ms 20156 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 4172 KB Output is correct
2 Correct 21 ms 4168 KB Output is correct
3 Correct 20 ms 4168 KB Output is correct
4 Correct 21 ms 4272 KB Output is correct
5 Correct 19 ms 4164 KB Output is correct
6 Correct 22 ms 4192 KB Output is correct
7 Correct 21 ms 4204 KB Output is correct
8 Correct 23 ms 4176 KB Output is correct
9 Correct 20 ms 4140 KB Output is correct
10 Correct 21 ms 4196 KB Output is correct
11 Correct 19 ms 4172 KB Output is correct
12 Correct 20 ms 4056 KB Output is correct
13 Correct 19 ms 4168 KB Output is correct
14 Correct 19 ms 4128 KB Output is correct
15 Correct 19 ms 4176 KB Output is correct
16 Correct 13 ms 2896 KB Output is correct
17 Correct 10 ms 2896 KB Output is correct
18 Correct 10 ms 2896 KB Output is correct
19 Correct 10 ms 2896 KB Output is correct
20 Correct 11 ms 2856 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 884 ms 20240 KB Output is correct
2 Correct 898 ms 20132 KB Output is correct
3 Correct 892 ms 20152 KB Output is correct
4 Correct 898 ms 20216 KB Output is correct
5 Correct 893 ms 20084 KB Output is correct
6 Correct 884 ms 20172 KB Output is correct
7 Correct 889 ms 20300 KB Output is correct
8 Correct 895 ms 20180 KB Output is correct
9 Correct 908 ms 20172 KB Output is correct
10 Correct 892 ms 20220 KB Output is correct
11 Correct 893 ms 20252 KB Output is correct
12 Correct 897 ms 20248 KB Output is correct
13 Correct 892 ms 20172 KB Output is correct
14 Correct 893 ms 20340 KB Output is correct
15 Correct 920 ms 20304 KB Output is correct
16 Correct 247 ms 9028 KB Output is correct
17 Correct 251 ms 9324 KB Output is correct
18 Correct 255 ms 9156 KB Output is correct
19 Correct 249 ms 9284 KB Output is correct
20 Correct 253 ms 9188 KB Output is correct
21 Correct 375 ms 20304 KB Output is correct
22 Correct 382 ms 20096 KB Output is correct
23 Correct 360 ms 19940 KB Output is correct
24 Correct 379 ms 20016 KB Output is correct
25 Correct 376 ms 20200 KB Output is correct
26 Correct 510 ms 20276 KB Output is correct
27 Correct 515 ms 20508 KB Output is correct
28 Correct 522 ms 20284 KB Output is correct
29 Correct 510 ms 20280 KB Output is correct
30 Correct 831 ms 20284 KB Output is correct
31 Correct 851 ms 20272 KB Output is correct
32 Correct 858 ms 20240 KB Output is correct
33 Correct 845 ms 20196 KB Output is correct
34 Correct 823 ms 20276 KB Output is correct
35 Correct 839 ms 20152 KB Output is correct
36 Correct 826 ms 20236 KB Output is correct
37 Correct 849 ms 20152 KB Output is correct
38 Correct 832 ms 20156 KB Output is correct
39 Correct 19 ms 4172 KB Output is correct
40 Correct 21 ms 4168 KB Output is correct
41 Correct 20 ms 4168 KB Output is correct
42 Correct 21 ms 4272 KB Output is correct
43 Correct 19 ms 4164 KB Output is correct
44 Correct 22 ms 4192 KB Output is correct
45 Correct 21 ms 4204 KB Output is correct
46 Correct 23 ms 4176 KB Output is correct
47 Correct 20 ms 4140 KB Output is correct
48 Correct 21 ms 4196 KB Output is correct
49 Correct 19 ms 4172 KB Output is correct
50 Correct 20 ms 4056 KB Output is correct
51 Correct 19 ms 4168 KB Output is correct
52 Correct 19 ms 4128 KB Output is correct
53 Correct 19 ms 4176 KB Output is correct
54 Correct 13 ms 2896 KB Output is correct
55 Correct 10 ms 2896 KB Output is correct
56 Correct 10 ms 2896 KB Output is correct
57 Correct 10 ms 2896 KB Output is correct
58 Correct 11 ms 2856 KB Output is correct
59 Correct 1960 ms 21516 KB Output is correct
60 Correct 1910 ms 21348 KB Output is correct
61 Correct 1882 ms 21284 KB Output is correct
62 Correct 1931 ms 21472 KB Output is correct
63 Execution timed out 2009 ms 21360 KB Time limit exceeded
64 Halted 0 ms 0 KB -