Submission #830940

#	Time	Username	Problem	Language	Result	Execution time	Memory
830940		12345678	Kangaroo (CEOI16_kangaroo)	C++17	0 / 100	0 ms	340 KiB

kangaroo

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=2e3+5, mod=1e9+7;
ll dp[nx][nx], n, s, e, k=2;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>s>>e;
    dp[1][1]=1;
    for (int i=1; i<=n; i++)
    {
        if (i==s||i==e)
        {
            for (int j=1; j<i; j++)
            {
                dp[i][j+1]=(dp[i][j+1]+dp[i-1][j])%mod;
                dp[i][j]=(dp[i][j]+dp[i-1][j])%mod;
            }
            k--;
            continue;
        }
        for (int j=1; j<i; j++)
        {
            dp[i][j+1]=(dp[i][j+1]+dp[i-1][j]*(ll)(j+1-k-2))%mod;
            dp[i][j-1]=(dp[i][j-1]+dp[i-1][j]*(ll)(j-1))%mod;
        }
    }
    cout<<dp[n][1];
}

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