제출 #393922

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
393922		KhaledFarhat	Kangaroo (CEOI16_kangaroo)	C++14	0 / 100	1 ms	460 KiB

kangaroo

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

const int MOD = 1000000007;

int Add(int x, int y) {
    return (x + y) % MOD;
}

void Increase(int& x, int y) {
    x = Add(x, y);
}

int Multiply(int x, int y) {
    return 1LL * x * y % MOD;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, startPosition, finishPosition;
    cin >> n >> startPosition >> finishPosition;

    vector<vector<int>> ways(n + 2, vector<int>(n + 1));

    ways[1][0] = 1;

    for (int i = 1; i <= n; ++i) {
        for (int components = 0; components < i; ++components) {
            if (ways[i][components] == 0) {
                continue;
            }

            if (i == startPosition || i == finishPosition) {
                Increase(ways[i + 1][components + 1], ways[i][components]); // open a new component on the side
                Increase(ways[i + 1][components], ways[i][components]); // append to the side
            }
            else {
                // create a new component
                int validPosition = (components + 1) - (i > startPosition) - (i > finishPosition);
                Increase(ways[i + 1][components + 1], Multiply(validPosition, ways[i][components]));

                // merge two component
                validPosition = components - 1;
                Increase(ways[i + 1][components - 1], Multiply(validPosition, ways[i][components]));
            }
        }
    }

    cout << ways[n + 1][1];

    return 0;
}

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