제출 #1027571

#제출 시각아이디문제언어결과실행 시간메모리
1027571MuhammetBoat (APIO16_boat)C++17
9 / 100
1 ms348 KiB
#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define sz(x) (int)x.size()
#define ff first
#define ss second

const ll N = 505;
const ll M = 1e9 + 7;

ll T, n, a[N], b[N], dp[N];

int main(){
    ios::sync_with_stdio(false); cin.tie(0);

    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i] >> b[i];
        dp[i] = 1;
    }
    ll ans = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j < i; j++){
            if(a[j] < a[i]) dp[i] += (dp[j]);
        }
        dp[i] %= M;
        ans += dp[i];
        ans %= M;
    }

    cout << ans;

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