제출 #1188289

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1188289		Malix	Boat (APIO16_boat)	C++20	9 / 100	2099 ms	180008 KiB

boat

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<ll,ll,ll> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
 
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

int main() {   
// ios::sync_with_stdio(0);
// cin.tie(0);
    int n;cin>>n;
    vector<pi> a(n);
    REP(i,0,n)cin>>a[i].F>>a[i].S;
    vector<map<int,ll>> dp(n);
    REP(i,0,n){
        REP(k,a[i].F,a[i].S+1){
            dp[i][k]=1;
            REP(j,0,i){
                ll val=0;
                if(a[j].F>=k)val=0;
                else if(a[j].S<k)val=dp[j][a[j].S];
                else val=dp[j][k-1];
                dp[i][k]+=val;
                dp[i][k]%=M;
            }
            if(k!=a[i].F){
                dp[i][k]+=dp[i][k-1];
                dp[i][k]%=M;
            }
        }
    }
    ll ans=0;
    REP(i,0,n){
        ans+=dp[i][a[i].S];
        ans%=M;
    }
    cout<<ans;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 27
• Subtask 4: 0 / 42