This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N=510;
const int M=1000000007;
int n,kq;
int a[N],b[N];
int f[N][N];
int main()
{
ios_base::sync_with_stdio(false),cin.tie(nullptr);
cin>>n;
f[0][0]=1;
for(int i=1;i<=n;++i) cin>>a[i]>>b[i];
for(int i=1;i<=n;++i) for(int j=0;j<i;++j)
{
if(a[j]<a[i]) f[i][i]=(f[i][i]+f[i-1][j])%M;
f[i][j]=(f[i][j]+f[i-1][j])%M;
}
for(int i=0;i<=n;++i) kq=(kq+f[n][i])%M;
cout<<(kq-1+M)%M;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |