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;
#define int long long
int const N=505;
int const mod=1e9+7;
int dp[N];
int arr[N];
signed main(){
int n;
cin>>n;
for (int i = 1; i <=n; ++i)
cin>>arr[i]>>arr[i];
dp[0]=1;
for(int i=1;i<=n;i++){
dp[i]=dp[i-1];
for(int j=i-1;j>=0;j--)
if(arr[j]<arr[i]){
dp[i]+=dp[j];
dp[i]%=mod;
break;
}
}
dp[n]--;
dp[n]+=mod;
dp[n]%=mod;
cout<<dp[n]<<endl;
return 0;
}
# | 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... |