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;
typedef long long ll;
const ll N = 505, mod = 1e9 + 7;
ll dp[N];
int main(){
ll n;
cin >> n;
vector<pair<ll, ll>> vec;
for (ll i = 0; i < n; i ++){
ll x, y;
cin >> x >> y;
vec.push_back({x, y});
}
ll ans = 0;
for (ll i = 0; i < n; i ++){
dp[i] = 1;
for (ll j = 0; j < i; j ++)
if (vec[j].first < vec[i].first)
dp[i] += dp[j];
dp[i] %= mod;
ans += dp[i];
ans %= mod;
}
cout << ans << endl;
}
# | 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... |