Submission #718339

#TimeUsernameProblemLanguageResultExecution timeMemory
718339irmuunBoat (APIO16_boat)C++17
9 / 100
2 ms312 KiB
#include<bits/stdc++.h>

using namespace std;

#define pb push_back
#define ll long long
#define ff first
#define ss second
#define all(s) s.begin(),s.end()

const ll mod=1e9+7;

int main(){
    ll n;
    cin>>n;
    ll a[n+5],b[n+5];
    ll dp[n+5];
    for(ll i=1;i<=n;i++){
        cin>>a[i]>>b[i];
    }
    dp[1]=1;
    ll ans=1;
    for(ll i=2;i<=n;i++){
        dp[i]=1;
        for(ll j=1;j<i;j++){
            if(a[j]<a[i]){
                dp[i]+=dp[j];
                dp[i]%=mod;
            }
        }
        ans=(ans+dp[i])%mod;
    }
    cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...