제출 #23571

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
23571		repeating	Boat (APIO16_boat)	C++11	9 / 100	2000 ms	524288 KiB

boat

#include <bits/stdc++.h>
#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define pll pair<ll,ll>
#define SF(x) scanf("%I64d",&x)

using namespace std;
const long long INF = 2e9;
long long MOD = 1e9+7;
ll n;
ll a[555];
ll b[555];
map<ll,ll>dp[555];
ll DP(ll x,ll last){
    if(x==n)R 1;
    ll p=DP(x+1,last);
    last=max(last,a[x]);
    ll &ret=dp[x][last];
    if(ret)R ret+p-1;
    ret=0;
    if(last<=b[x])
        ret=DP(x,last+1);
    ret%=MOD;
    ret++;
    R ret+p-1;
}
int main(){
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a[i]>>b[i];
    }
    cout<<(DP(0,1)-1)%MOD;
}

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