답안 #593380

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
593380 2022-07-11T02:22:11 Z Hanksburger 캥거루 (CEOI16_kangaroo) C++17
100 / 100
25 ms 31700 KB
#include <bits/stdc++.h>
using namespace std;
const long long mod=1e9+7;
long long dp[2005][2005];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, s, f;
    cin >> n >> s >> f;
    dp[0][0]=1;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=n; j++)
            dp[i][j]=((i==s || i==f)?(dp[i-1][j-1]+dp[i-1][j]):(dp[i-1][j+1]*j+dp[i-1][j-1]*(j-(i>s)-(i>f))))%mod;
    cout << dp[n][1];
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 1236 KB Output is correct
14 Correct 1 ms 1364 KB Output is correct
15 Correct 1 ms 1352 KB Output is correct
16 Correct 1 ms 1364 KB Output is correct
17 Correct 1 ms 1364 KB Output is correct
18 Correct 1 ms 1236 KB Output is correct
19 Correct 1 ms 1364 KB Output is correct
20 Correct 1 ms 1364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 1 ms 1236 KB Output is correct
14 Correct 1 ms 1364 KB Output is correct
15 Correct 1 ms 1352 KB Output is correct
16 Correct 1 ms 1364 KB Output is correct
17 Correct 1 ms 1364 KB Output is correct
18 Correct 1 ms 1236 KB Output is correct
19 Correct 1 ms 1364 KB Output is correct
20 Correct 1 ms 1364 KB Output is correct
21 Correct 4 ms 6228 KB Output is correct
22 Correct 4 ms 6868 KB Output is correct
23 Correct 5 ms 7764 KB Output is correct
24 Correct 21 ms 31664 KB Output is correct
25 Correct 25 ms 31636 KB Output is correct
26 Correct 20 ms 31700 KB Output is correct
27 Correct 21 ms 31560 KB Output is correct
28 Correct 14 ms 23756 KB Output is correct