Submission #110785

#TimeUsernameProblemLanguageResultExecution timeMemory
110785tictaccatBoat (APIO16_boat)C++14
9 / 100
17 ms384 KiB
#include <bits/stdc++.h>

using namespace std;

const int MAX = 500 + 5;
const int MOD = 1e9 + 7;

int N,ans;
vector<int> a(MAX), b(MAX), dp(MAX);

int main() {

    cin >> N;

    for (int i = 0; i < N; i++) cin >> a[i] >> b[i];

    for (int i = 0; i < N; i++) {
        dp[i] = 1;
        for (int j = 0; j < i; j++) {
            if (a[i] > a[j]) {
                dp[i] += dp[j];
                dp[i] %= MOD;
            }
        }
        ans += dp[i];
        ans %= MOD;
    }

    cout << ans << "\n";

    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...