oj.uz

답안 #23568

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
23568 2017-05-12T16:30:14 Z repeating Boat (APIO16_boat) C++11
0 / 100
 1806 ms 524288 KB 
#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 &ret=dp[x][max(a[x],last)];
    if(ret)R ret-1;
    ret=DP(x+1,last);
    last=max(last,a[x]);
    if(last<=b[x])
        ret+=DP(x,last+1);
    ret%=MOD;
    ret++;
    R ret-1;
}
int main(){
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a[i]>>b[i];
    }
    cout<<DP(0,1)-1;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2320 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2320 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Memory limit exceeded 1806 ms 524288 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 2320 KB Output isn't correct
2 Halted 0 ms 0 KB -