Submission #1118258

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

kangaroo

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

#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define vpii vector<pii>
#define pb push_back
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

const int N = 2005;
const int M = 1000000007;
ll dp[N][N];

void solve(){
    ll n,cs,cf,a = 0;
    cin >> n >> cs >> cf;
    dp[1][1] = 1;
    for(int i = 1; i <= n; i++){
        if(n == cs || n == cf) a++;
        for(int j = 1; j <= n; j++){
            if(i == cs || i == cf){
                dp[i][j] = (dp[i][j] + dp[i-1][j-1]) % M;
                dp[i][j] = (dp[i][j] + dp[i-1][j]) % M;
            }
            else{
                dp[i][j] = (dp[i][j] + (dp[i-1][j-1] * (j-a)) % M)%M;
                dp[i][j] = (dp[i][j] + (dp[i-1][j+1] * j) % M)%M;

            }
        }
    }
    cout << dp[n][1] << endl;
}

signed main(){
    fast;
    ll t = 1;
    //cin >> t;
    while(t--) solve();
}

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