oj.uz

Submission #745210

# Submission time Handle Problem Language Result Execution time Memory
745210 2023-05-19T14:55:45 Z amirhoseinfar1385 Boat (APIO16_boat) C++17
27 / 100
 435 ms 18380 KB 
#include<bits/stdc++.h>
using namespace std;
int mod=1e9+7;
 
long long mypow(long long m,long long y){
	if(y==0){
		return 1;
	}
	long long p=mypow(m,(y>>1));
	p*=p;
	p%=mod;
	if(y&1){
		p*=m;
		p%=mod;
	}
	return p;
}
 
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	vector<long long>rev(n+6);
	for(int i=0;i<=n+5;i++){
		rev[i]=mypow(i,mod-2);
	}
	vector<pair<int,int>>all(n+1);
	vector<int>allind;
	for(int i=1;i<=n;i++){
		cin>>all[i].first>>all[i].second;
		allind.push_back(all[i].first);
		allind.push_back(all[i].second);
		allind.push_back(all[i].first+1);
		allind.push_back(all[i].first-1);
		allind.push_back(all[i].second+1);
		allind.push_back(all[i].second-1);
	}
	allind.push_back(0);
	sort(allind.begin(),allind.end());
	allind.resize(unique(allind.begin(),allind.end())-allind.begin());
	int sz=(int)allind.size()+1;
	vector<vector<long long>>dp(sz+10,vector<long long>(sz+10));
	vector<long long>ps(sz+10);
	dp[0][0]=1;
	for(int i=0;i<sz+10;i++){
		ps[i]=1;
	}
	for(int i=1;i<=n;i++){
		int l=lower_bound(allind.begin(),allind.end(),all[i].first)-allind.begin();
		int r=lower_bound(allind.begin(),allind.end(),all[i].second)-allind.begin();
		for(int j=l;j<=r;j++){
			long long cnt=allind[j]-allind[j-1];
			for(int h=n;h>=2;h--){
				dp[j][h]+=dp[j][h-1]*(cnt-(h-1))%mod*rev[h]%mod;
				dp[j][h]%=mod;
			}
			dp[j][1]+=ps[j-1]*cnt%mod;
			dp[j][1]%=mod;
		}
		ps[0]=dp[0][0];
		for(int i=1;i<=sz+9;i++){
			ps[i]=ps[i-1];
			for(int h=0;h<=n;h++){
				ps[i]+=dp[i][h];
			}
			ps[i]%=mod;
		}
	}
	long long res=ps[sz+8];
	res+=mod-1;
	res%=mod;
	cout<<res<<"\n";
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 18292 KB Output is correct
2 Correct 345 ms 18380 KB Output is correct
3 Correct 335 ms 18260 KB Output is correct
4 Correct 435 ms 18300 KB Output is correct
5 Correct 409 ms 18300 KB Output is correct
6 Correct 353 ms 18300 KB Output is correct
7 Correct 350 ms 18300 KB Output is correct
8 Correct 342 ms 18260 KB Output is correct
9 Correct 339 ms 18260 KB Output is correct
10 Correct 349 ms 18292 KB Output is correct
11 Correct 349 ms 18380 KB Output is correct
12 Correct 359 ms 18356 KB Output is correct
13 Correct 353 ms 18300 KB Output is correct
14 Correct 361 ms 18292 KB Output is correct
15 Correct 341 ms 18296 KB Output is correct
16 Incorrect 45 ms 852 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 18292 KB Output is correct
2 Correct 345 ms 18380 KB Output is correct
3 Correct 335 ms 18260 KB Output is correct
4 Correct 435 ms 18300 KB Output is correct
5 Correct 409 ms 18300 KB Output is correct
6 Correct 353 ms 18300 KB Output is correct
7 Correct 350 ms 18300 KB Output is correct
8 Correct 342 ms 18260 KB Output is correct
9 Correct 339 ms 18260 KB Output is correct
10 Correct 349 ms 18292 KB Output is correct
11 Correct 349 ms 18380 KB Output is correct
12 Correct 359 ms 18356 KB Output is correct
13 Correct 353 ms 18300 KB Output is correct
14 Correct 361 ms 18292 KB Output is correct
15 Correct 341 ms 18296 KB Output is correct
16 Incorrect 45 ms 852 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 3232 KB Output is correct
2 Correct 30 ms 3252 KB Output is correct
3 Correct 34 ms 3252 KB Output is correct
4 Correct 35 ms 3156 KB Output is correct
5 Correct 38 ms 3156 KB Output is correct
6 Correct 53 ms 3216 KB Output is correct
7 Correct 50 ms 3156 KB Output is correct
8 Correct 51 ms 3156 KB Output is correct
9 Correct 51 ms 3156 KB Output is correct
10 Correct 51 ms 3156 KB Output is correct
11 Correct 43 ms 3156 KB Output is correct
12 Correct 31 ms 3156 KB Output is correct
13 Correct 35 ms 3156 KB Output is correct
14 Correct 36 ms 3156 KB Output is correct
15 Correct 38 ms 3156 KB Output is correct
16 Correct 16 ms 852 KB Output is correct
17 Correct 15 ms 852 KB Output is correct
18 Correct 14 ms 852 KB Output is correct
19 Correct 15 ms 852 KB Output is correct
20 Correct 17 ms 852 KB Output is correct

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 18292 KB Output is correct
2 Correct 345 ms 18380 KB Output is correct
3 Correct 335 ms 18260 KB Output is correct
4 Correct 435 ms 18300 KB Output is correct
5 Correct 409 ms 18300 KB Output is correct
6 Correct 353 ms 18300 KB Output is correct
7 Correct 350 ms 18300 KB Output is correct
8 Correct 342 ms 18260 KB Output is correct
9 Correct 339 ms 18260 KB Output is correct
10 Correct 349 ms 18292 KB Output is correct
11 Correct 349 ms 18380 KB Output is correct
12 Correct 359 ms 18356 KB Output is correct
13 Correct 353 ms 18300 KB Output is correct
14 Correct 361 ms 18292 KB Output is correct
15 Correct 341 ms 18296 KB Output is correct
16 Incorrect 45 ms 852 KB Output isn't correct
17 Halted 0 ms 0 KB -