oj.uz

답안 #613878

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
613878 2022-07-30T12:19:19 Z 2fat2code 캥거루 (CEOI16_kangaroo) C++17
100 / 100
 18 ms 22984 KB 
#include "bits/stdc++.h"
#define fr first
#define sc second
#define int long long
#define all(s) s.begin(), s.end()
#define rc(s) return cout << s, 0
using namespace std;

const int mod = 1e9 + 7;
const int nmax = 2005;

int n, s, t, dp[nmax][nmax];

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    //freopen("input.in", "r", stdin);
    cin >> n >> s >> t;
    if(s > t) swap(s, t);
    dp[0][0] = 1;
    for(int i=1;i<n;i++){
        for(int j=1;j<=i;j++){
            if(i < s){
                dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j + 1] * ((j + 1) * j % mod) % mod) % mod;
            }
            else if(i == s){
                dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j] * j % mod) % mod;
            }
            else if(i > s && i < t){
                dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j + 1] * (j * (j - 1) % mod) % mod + dp[i - 1][j + 1] * j % mod) % mod;
            }
            else if(i == t){
                dp[i][j] = (dp[i - 1][j] + dp[i - 1][j + 1] * j % mod) % mod;
            }
            else{
                dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j + 1] * ((j + 1) * j % mod) % mod) % mod;
            }
        }
    }
    cout << dp[n - 1][1] << '\n';
}

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 468 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1236 KB Output is correct
15 Correct 1 ms 1236 KB Output is correct
16 Correct 1 ms 1236 KB Output is correct
17 Correct 1 ms 1236 KB Output is correct
18 Correct 1 ms 1096 KB Output is correct
19 Correct 1 ms 1232 KB Output is correct
20 Correct 1 ms 1236 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1236 KB Output is correct
15 Correct 1 ms 1236 KB Output is correct
16 Correct 1 ms 1236 KB Output is correct
17 Correct 1 ms 1236 KB Output is correct
18 Correct 1 ms 1096 KB Output is correct
19 Correct 1 ms 1232 KB Output is correct
20 Correct 1 ms 1236 KB Output is correct
21 Correct 3 ms 4600 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 4 ms 5576 KB Output is correct
24 Correct 16 ms 22868 KB Output is correct
25 Correct 18 ms 22984 KB Output is correct
26 Correct 17 ms 22916 KB Output is correct
27 Correct 16 ms 22744 KB Output is correct
28 Correct 10 ms 15060 KB Output is correct