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 <iostream>
using namespace std;
int mod = 1e9 + 7;
int main()
{
int N;
cin >> N;
int a[N+1], b[N+1];
for(int i = 1; i <= N; i++) cin >> a[i] >> b[i];
a[0] = b[0] = 0;
int dp[N+1];
dp[0] = 1;
int res = 0;
for(int i = 1; i <= N; i++)
{
dp[i] = 0;
for(int j = 0; j < i; j++) if(a[j] < a[i]) dp[i] = (dp[i] + dp[j]) % mod;
res = (res + dp[i]) % mod;
}
cout << res << '\n';
}
# | 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... |