Submission #318339

# Submission time Handle Problem Language Result Execution time Memory
318339 2020-11-01T10:12:05 Z HPC Kangaroo (CEOI16_kangaroo) C++17
100 / 100
28 ms 31724 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MAXN=2e3+5;
const ll MOD = 1e9+7;

int N, S, T;
ll dp[MAXN][MAXN];

int main(){
    cin >> N >> S >> T;
    if(S > T){
        swap(S,T);
    }
    if(N == 1){
        cout << "1\n";
        return 0;
    }
    dp[0][0] = 1;
    for(int i=1;i<=N;i++){
        for(int j=1;j<=N;j++){
            if(i == S || i == T){
                dp[i][j] = dp[i-1][j]+dp[i-1][j-1];
            }else if(i > T){
                dp[i][j] = (j-2)*dp[i-1][j-1]+j*dp[i-1][j+1];
            }else if(i > S){
                dp[i][j] = (j-1)*dp[i-1][j-1]+j*dp[i-1][j+1];
            }else{
                dp[i][j] = j*dp[i-1][j-1]+j*dp[i-1][j+1];
            }/*
            dp[i][j][0] = j*dp[i-1][j-1][0]+j*dp[i-1][j+1][0];
            dp[i][j][1] = (j-1)*dp[i-1][j-1][1]+j*dp[i-1][j+1][1]+2*dp[i-1][j][0]+2*dp[i-1][j-1][0];
            dp[i][j][2] = (j-2)*dp[i-1][j-1][2]+j*dp[i-1][j+1][2]+dp[i-1][j][1]+dp[i-1][j-1][1];*/
            dp[i][j] %= MOD;
        }
    }
    cout << dp[N][1] << '\n';
  	return 0;
}

/*
https://oj.uz/problem/view/CEOI16_kangaroo
A[i]>A[i-1] 
2 1 5 3 4
(N-2)!
*/
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 1516 KB Output is correct
13 Correct 1 ms 1388 KB Output is correct
14 Correct 1 ms 1388 KB Output is correct
15 Correct 1 ms 1516 KB Output is correct
16 Correct 1 ms 1388 KB Output is correct
17 Correct 1 ms 1516 KB Output is correct
18 Correct 1 ms 1260 KB Output is correct
19 Correct 1 ms 1388 KB Output is correct
20 Correct 1 ms 1516 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 1516 KB Output is correct
13 Correct 1 ms 1388 KB Output is correct
14 Correct 1 ms 1388 KB Output is correct
15 Correct 1 ms 1516 KB Output is correct
16 Correct 1 ms 1388 KB Output is correct
17 Correct 1 ms 1516 KB Output is correct
18 Correct 1 ms 1260 KB Output is correct
19 Correct 1 ms 1388 KB Output is correct
20 Correct 1 ms 1516 KB Output is correct
21 Correct 5 ms 6380 KB Output is correct
22 Correct 5 ms 7148 KB Output is correct
23 Correct 6 ms 7788 KB Output is correct
24 Correct 27 ms 31724 KB Output is correct
25 Correct 27 ms 31724 KB Output is correct
26 Correct 28 ms 31716 KB Output is correct
27 Correct 27 ms 31588 KB Output is correct
28 Correct 19 ms 23788 KB Output is correct