oj.uz

답안 #129373

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
129373 2019-07-12T07:05:56 Z DodgeBallMan 캥거루 (CEOI16_kangaroo) C++14
100 / 100
 101 ms 32248 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 2e3 + 10;
const int mod = 1e9 + 7;    
int n, s, e;
long long dp[N][N];

long long solve( int i, int j ) {
    if( dp[i][j] != -1 ) return dp[i][j];
    if( j == 0 ) return dp[i][j] = 0;
    if( i == 1 ) return dp[i][j] = j == 1 ? 1 : 0;
    if( i == s || i == e ) return dp[i][j] = ( solve( i-1, j-1 ) + solve( i-1, j ) ) % mod;
    return dp[i][j] = ( solve( i-1, j+1 ) * j + solve( i-1, j-1 ) * ( j - ( i > s ? 1 : 0 ) - ( i > e ? 1 : 0 ) ) ) % mod;
}
int main()
{
    memset( dp, -1, sizeof dp );
    scanf("%d %d %d",&n,&s,&e);
    printf("%lld",solve( n, 1 ));
    return 0;
}

Compilation message

kangaroo.cpp: In function 'int main()':
kangaroo.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d",&n,&s,&e);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 31992 KB Output is correct
2 Correct 29 ms 31992 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 31992 KB Output is correct
2 Correct 29 ms 31992 KB Output is correct
3 Correct 28 ms 32024 KB Output is correct
4 Correct 29 ms 31992 KB Output is correct
5 Correct 31 ms 31992 KB Output is correct
6 Correct 34 ms 31868 KB Output is correct
7 Correct 34 ms 31896 KB Output is correct
8 Correct 29 ms 31864 KB Output is correct
9 Correct 37 ms 31964 KB Output is correct
10 Correct 32 ms 31992 KB Output is correct
11 Correct 29 ms 31864 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 31992 KB Output is correct
2 Correct 29 ms 31992 KB Output is correct
3 Correct 28 ms 32024 KB Output is correct
4 Correct 29 ms 31992 KB Output is correct
5 Correct 31 ms 31992 KB Output is correct
6 Correct 34 ms 31868 KB Output is correct
7 Correct 34 ms 31896 KB Output is correct
8 Correct 29 ms 31864 KB Output is correct
9 Correct 37 ms 31964 KB Output is correct
10 Correct 32 ms 31992 KB Output is correct
11 Correct 29 ms 31864 KB Output is correct
12 Correct 29 ms 31992 KB Output is correct
13 Correct 29 ms 31964 KB Output is correct
14 Correct 29 ms 31992 KB Output is correct
15 Correct 29 ms 31916 KB Output is correct
16 Correct 29 ms 31992 KB Output is correct
17 Correct 29 ms 31992 KB Output is correct
18 Correct 29 ms 31992 KB Output is correct
19 Correct 29 ms 31992 KB Output is correct
20 Correct 29 ms 31992 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 31992 KB Output is correct
2 Correct 29 ms 31992 KB Output is correct
3 Correct 28 ms 32024 KB Output is correct
4 Correct 29 ms 31992 KB Output is correct
5 Correct 31 ms 31992 KB Output is correct
6 Correct 34 ms 31868 KB Output is correct
7 Correct 34 ms 31896 KB Output is correct
8 Correct 29 ms 31864 KB Output is correct
9 Correct 37 ms 31964 KB Output is correct
10 Correct 32 ms 31992 KB Output is correct
11 Correct 29 ms 31864 KB Output is correct
12 Correct 29 ms 31992 KB Output is correct
13 Correct 29 ms 31964 KB Output is correct
14 Correct 29 ms 31992 KB Output is correct
15 Correct 29 ms 31916 KB Output is correct
16 Correct 29 ms 31992 KB Output is correct
17 Correct 29 ms 31992 KB Output is correct
18 Correct 29 ms 31992 KB Output is correct
19 Correct 29 ms 31992 KB Output is correct
20 Correct 29 ms 31992 KB Output is correct
21 Correct 34 ms 31992 KB Output is correct
22 Correct 35 ms 31992 KB Output is correct
23 Correct 36 ms 31992 KB Output is correct
24 Correct 101 ms 32248 KB Output is correct
25 Correct 90 ms 32120 KB Output is correct
26 Correct 91 ms 32120 KB Output is correct
27 Correct 77 ms 32120 KB Output is correct
28 Correct 57 ms 32120 KB Output is correct