Submission #946617

#	Time	Username	Problem	Language	Result	Execution time	Memory
946617		vjudge1	Kangaroo (CEOI16_kangaroo)	C++17	0 / 100	0 ms	348 KiB

kangaroo

#include <bits/stdc++.h>
using namespace std;

using LL = long long;
using PII = pair<int, int>;

const int N = 4000;
int dp[N][N];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, cs, cf;
    cin >> n >> cs >> cf;

    dp[1][1] = 1;

    for(int i = 2; i <= n; ++i){
        for(int j = 1; j <= i; ++j){
            if(i == cs or i == cf) dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1];
            else {
                dp[i][j] += dp[i - 1][j + 1] * j; //merging of two component
                dp[i][j] += dp[i - 1][j - 1] * j; // start of a new component
            }
        } 
    }

    cout << dp[n][1]<<"\n";
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 30
• Subtask 3: 0 / 15
• Subtask 4: 0 / 49