제출 #443330

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
443330		1e18	캥거루 (CEOI16_kangaroo)	C++14	0 / 100	0 ms	332 KiB

kangaroo

#define _CRT_SECURE_NO_WARNINGS
#include <random>
#include <limits>
#include <assert.h>
#include <time.h>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
#include <utility>
#include <algorithm>
#include <iterator>
#include <numeric>
#include <string>
#include <set>
#include <map>
using namespace std;
#define forn(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define whats(a) cerr<<#a<<" "<<a<<endl;
#define Mod(a,b) (((a)%(b)+(b))%(b))
#define sz(x) (int((x).size()))
typedef long long ll;
typedef int Int;
//#define int ll

typedef vector<int> vec;
typedef vector<vec> mat;

const int N = 2000;
const int MOD = 1e9 + 7;

int dp[N + 1][N + 1];

void cadd(int& a, int b) {
    a += b;
    if (a >= MOD)a -= MOD;
}

int mul(int a, int b) {
    ll res = a * b;
    return res % MOD;
}

Int main(Int argc, char* argv[])
{
#ifdef Home
    freopen("inp.txt", "rb", stdin);
#else
    //FILE* a = freopen("kangaroo.in", "rb", stdin);
    //FILE* b = freopen("kangaroo.out", "wb", stdout);
#endif
    ios::sync_with_stdio(0);

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

    dp[1][1] = 1;
    for (int i = 1; i < n; i++) {
        for (int j = 1; j < n; j++) {
            if (i == cs || i == cf) {
                cadd(dp[i + 1][j + 1], dp[i][j]);
                cadd(dp[i + 1][j], dp[i][j]);
            } else {
                if (j >= 2) {
                    cadd(dp[i + 1][j - 1], mul(dp[i][j], j - 1));
                }
                cadd(dp[i + 1][j + 1], mul(dp[i][j], j + 1 - (i < cf) - (i < cs)));
            }
        }
    }

    cout << dp[n][1];


    return 0;
}

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