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 long long mod = 1E9 + 7;
int main() {
int n;
cin >> n;
long long boat[n][2];
for (int i = 0; i < n; ++i) {
cin >> boat[i][0] >> boat[i][1];
}
long long dp[n], answer = 0;
for (int i = 0; i < n; ++i) {
dp[i] = 1;
for (int j = 0; j < i; ++j) {
if (boat[j][0] < boat[i][0]) {
dp[i] += dp[j];
}
}
dp[i] %= mod;
answer += dp[i];
}
answer %= mod;
cout << answer << '\n';
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... |