Submission #1015185

#TimeUsernameProblemLanguageResultExecution timeMemory
1015185vjudge1Boat (APIO16_boat)C++17
0 / 100
1 ms444 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...