Submission #1118210

#	Time	Username	Problem	Language	Result	Execution time	Memory
1118210		vjudge1	캥거루 (CEOI16_kangaroo)	C++17	6 / 100	1 ms	336 KiB

kangaroo

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

int main() {

  constexpr int MOD = 1000000007;

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

  vector<vector<int>> dp(n + 3, vector<int>(n + 3, 0));
  dp[1][1] = 1;

  for (int i = 1; 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][j + 1] += dp[i - 1][j];
        dp[i][j] %= MOD;
        dp[i][j + 1] %= MOD;
        continue;
      }
      dp[i][j - 1] += dp[i - 1][j] * (j - 1);
      dp[i][j + 1] += dp[i - 1][j] * (j + 1 - (int)(i >= cs) - (int)(i >= cf));
      dp[i][j - 1] %= MOD;
      dp[i][j + 1] %= MOD;
    }
  }

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

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