Submission #1015265

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