oj.uz

답안 #96902

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
96902 2019-02-12T17:04:43 Z Kastanda 캥거루 (CEOI16_kangaroo) C++11
100 / 100
 19 ms 14336 KB 
// I do it for the glory
#include<bits/stdc++.h>
using namespace std;
const int N = 2059, Mod = 1e9 + 7;
int dp[N][N];
int main()
{
    int n, s, f;
    scanf("%d%d%d", &n, &s, &f);
    int cnt = 0; dp[0][0] = 1;
    for (int i = 1; i <= n; cnt += (i == s || i == f), i++)
        for (int j = 1; j <= i; j++)
        {
            if (i == s || i == f)
                dp[i][j] = (dp[i - 1][j] + dp[i - 1][j - 1]) % Mod;
            else
                dp[i][j] = (1LL * dp[i - 1][j + 1] * j + 1LL * dp[i - 1][j - 1] * (j - cnt)) % Mod;
        }
    return !printf("%d\n", dp[n][1]);
}

Compilation message

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

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 1152 KB Output is correct
13 Correct 3 ms 1152 KB Output is correct
14 Correct 3 ms 1280 KB Output is correct
15 Correct 3 ms 1280 KB Output is correct
16 Correct 3 ms 1280 KB Output is correct
17 Correct 2 ms 1280 KB Output is correct
18 Correct 1 ms 1024 KB Output is correct
19 Correct 4 ms 1280 KB Output is correct
20 Correct 4 ms 1280 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 1152 KB Output is correct
13 Correct 3 ms 1152 KB Output is correct
14 Correct 3 ms 1280 KB Output is correct
15 Correct 3 ms 1280 KB Output is correct
16 Correct 3 ms 1280 KB Output is correct
17 Correct 2 ms 1280 KB Output is correct
18 Correct 1 ms 1024 KB Output is correct
19 Correct 4 ms 1280 KB Output is correct
20 Correct 4 ms 1280 KB Output is correct
21 Correct 7 ms 3840 KB Output is correct
22 Correct 5 ms 4096 KB Output is correct
23 Correct 6 ms 4480 KB Output is correct
24 Correct 19 ms 14328 KB Output is correct
25 Correct 18 ms 14336 KB Output is correct
26 Correct 19 ms 14328 KB Output is correct
27 Correct 19 ms 14320 KB Output is correct
28 Correct 16 ms 10368 KB Output is correct