답안 #23571

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
23571 2017-05-12T16:41:40 Z repeating Boat (APIO16_boat) C++11
9 / 100
2000 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 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;
}

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 5884 KB Output is correct
2 Correct 13 ms 5884 KB Output is correct
3 Correct 13 ms 6016 KB Output is correct
4 Correct 16 ms 6148 KB Output is correct
5 Correct 16 ms 5884 KB Output is correct
6 Correct 0 ms 2320 KB Output is correct
7 Correct 0 ms 2320 KB Output is correct
8 Correct 0 ms 2320 KB Output is correct
9 Correct 3 ms 2320 KB Output is correct
10 Correct 3 ms 2320 KB Output is correct
11 Correct 0 ms 2320 KB Output is correct
12 Correct 3 ms 2452 KB Output is correct
13 Correct 3 ms 2320 KB Output is correct
14 Correct 0 ms 2188 KB Output is correct
15 Correct 3 ms 2320 KB Output is correct
16 Correct 9 ms 3376 KB Output is correct
17 Correct 9 ms 3508 KB Output is correct
18 Correct 9 ms 3508 KB Output is correct
19 Correct 9 ms 3640 KB Output is correct
20 Correct 9 ms 3376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 5884 KB Output is correct
2 Correct 13 ms 5884 KB Output is correct
3 Correct 13 ms 6016 KB Output is correct
4 Correct 16 ms 6148 KB Output is correct
5 Correct 16 ms 5884 KB Output is correct
6 Correct 0 ms 2320 KB Output is correct
7 Correct 0 ms 2320 KB Output is correct
8 Correct 0 ms 2320 KB Output is correct
9 Correct 3 ms 2320 KB Output is correct
10 Correct 3 ms 2320 KB Output is correct
11 Correct 0 ms 2320 KB Output is correct
12 Correct 3 ms 2452 KB Output is correct
13 Correct 3 ms 2320 KB Output is correct
14 Correct 0 ms 2188 KB Output is correct
15 Correct 3 ms 2320 KB Output is correct
16 Correct 9 ms 3376 KB Output is correct
17 Correct 9 ms 3508 KB Output is correct
18 Correct 9 ms 3508 KB Output is correct
19 Correct 9 ms 3640 KB Output is correct
20 Correct 9 ms 3376 KB Output is correct
21 Execution timed out 2000 ms 32452 KB Execution timed out
22 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Memory limit exceeded 1519 ms 524288 KB Memory limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 5884 KB Output is correct
2 Correct 13 ms 5884 KB Output is correct
3 Correct 13 ms 6016 KB Output is correct
4 Correct 16 ms 6148 KB Output is correct
5 Correct 16 ms 5884 KB Output is correct
6 Correct 0 ms 2320 KB Output is correct
7 Correct 0 ms 2320 KB Output is correct
8 Correct 0 ms 2320 KB Output is correct
9 Correct 3 ms 2320 KB Output is correct
10 Correct 3 ms 2320 KB Output is correct
11 Correct 0 ms 2320 KB Output is correct
12 Correct 3 ms 2452 KB Output is correct
13 Correct 3 ms 2320 KB Output is correct
14 Correct 0 ms 2188 KB Output is correct
15 Correct 3 ms 2320 KB Output is correct
16 Correct 9 ms 3376 KB Output is correct
17 Correct 9 ms 3508 KB Output is correct
18 Correct 9 ms 3508 KB Output is correct
19 Correct 9 ms 3640 KB Output is correct
20 Correct 9 ms 3376 KB Output is correct
21 Execution timed out 2000 ms 32452 KB Execution timed out
22 Halted 0 ms 0 KB -