#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=505;
const int mod=1e9+7;
int n,l[N],r[N],dp[N][N*2],sum[N][N*2],igt[N],gt[N],ways[N][N*2];
int Power(int x,int n)
{
if(!n) return 1;
if(n%2) return Power(x,n-1)*x%mod;
int tmp=Power(x,n/2);
return tmp*tmp%mod;
}
void init()
{
gt[0]=1;
for(int i=1;i<=N-5;i++) gt[i]=gt[i-1]*i%mod;
igt[N-5]=Power(gt[N-5],mod-2);
for(int i=N-5-1;i>=0;i--) igt[i]=igt[i+1]*(i+1)%mod;
}
int C(int k,int n)
{
if(k<0||k>n) return 0;
int res=1;
for(int i=n-k+1;i<=n;i++) res=res*i%mod;
return res*igt[k]%mod;
}
main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin>>n;
init();
vector<int>val;
for(int i=1;i<=n;i++)
{
cin>>l[i]>>r[i];
r[i]++;
val.push_back(l[i]);
val.push_back(r[i]);
}
val.push_back(0);
sort(val.begin(),val.end());
val.erase(unique(val.begin(),val.end()),val.end());
for(int i=1;i<=n;i++)
{
l[i]=lower_bound(val.begin(),val.end(),l[i])-val.begin();
r[i]=lower_bound(val.begin(),val.end(),r[i])-val.begin();
}
int sz=val.size()-1;
for(int i=1;i<=sz-1;i++)
{
for(int j=1;j<=n;j++) ways[i][j]=(ways[i][j-1]+C(j,val[i+1]-val[i]))%mod;
}
int res=0;
dp[0][0]=1;
for(int j=0;j<=sz-1;j++) sum[0][j]=1;
for(int i=1;i<=n;i++)
{
for(int j=l[i];j<r[i];j++)
{
for(int k=1;k<=i;k++)
{
dp[i][j]=(dp[i][j]+sum[k-1][j-1]*ways[j][i-k+1]%mod)%mod;
}
}
sum[i][0]=dp[i][0];
for(int j=1;j<=sz-1;j++)
{
sum[i][j]=(sum[i][j-1]+dp[i][j])%mod;
//cout<<i<<' '<<val[j]<<' '<<val[j+1]<<' '<<dp[i][j]<<'\n';
}
res=(res+sum[i][sz-1])%mod;
}
cout<<res;
}
Compilation message
boat.cpp:33:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
33 | main()
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
296 ms |
10232 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
296 ms |
10232 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
8 ms |
2304 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
296 ms |
10232 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |