oj.uz

답안 #126806

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
126806 2019-07-08T12:58:39 Z PeppaPig 캥거루 (CEOI16_kangaroo) C++14
100 / 100
 42 ms 23032 KB 
#include <bits/stdc++.h>

#define long long long

using namespace std;

const int N = 2e3+5;
const int M = 1e9+7;

int n, s, e;
long dp[N][N];

int main() {
    scanf("%d %d %d", &n, &s, &e);
    dp[1][1] = 1;
    for(int i = 2; i <= n; i++) for(int j = 1; j <= i; j++) {
        if(i == s || i == e) {
            dp[i][j] = (dp[i][j] + dp[i-1][j]) % M;
            dp[i][j] = (dp[i][j] + dp[i-1][j-1]) % M;
        } else {
            dp[i][j] = (dp[i][j] + dp[i-1][j+1] * j) % M;
            dp[i][j] = (dp[i][j] + dp[i-1][j-1] * (j - (i > s) - (i > e))) % M;
        }
    }
    printf("%lld\n", dp[n][1]);

    return 0;
}

Compilation message

kangaroo.cpp: In function 'int main()':
kangaroo.cpp:14: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 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 508 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 508 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 4 ms 1272 KB Output is correct
13 Correct 3 ms 1272 KB Output is correct
14 Correct 4 ms 1272 KB Output is correct
15 Correct 3 ms 1272 KB Output is correct
16 Correct 4 ms 1272 KB Output is correct
17 Correct 3 ms 1272 KB Output is correct
18 Correct 4 ms 1144 KB Output is correct
19 Correct 3 ms 1272 KB Output is correct
20 Correct 3 ms 1276 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 508 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 4 ms 1272 KB Output is correct
13 Correct 3 ms 1272 KB Output is correct
14 Correct 4 ms 1272 KB Output is correct
15 Correct 3 ms 1272 KB Output is correct
16 Correct 4 ms 1272 KB Output is correct
17 Correct 3 ms 1272 KB Output is correct
18 Correct 4 ms 1144 KB Output is correct
19 Correct 3 ms 1272 KB Output is correct
20 Correct 3 ms 1276 KB Output is correct
21 Correct 8 ms 4728 KB Output is correct
22 Correct 9 ms 5160 KB Output is correct
23 Correct 9 ms 5596 KB Output is correct
24 Correct 38 ms 23004 KB Output is correct
25 Correct 42 ms 23008 KB Output is correct
26 Correct 37 ms 23032 KB Output is correct
27 Correct 38 ms 22852 KB Output is correct
28 Correct 26 ms 15096 KB Output is correct