Submission #660529

#	Time	Username	Problem	Language	Result	Execution time	Memory
660529		Alex_tz307	캥거루 (CEOI16_kangaroo)	C++17	100 / 100	11 ms	328 KiB

kangaroo

#include <bits/stdc++.h>

using namespace std;

const int kN = 2e3;
const int mod = 1e9 + 7;
int dp[2][1 + kN];

void addSelf(int &x, int y) {
  x += y;
  if (x >= mod) {
    x -= mod;
  }
}

int add(int x, int y) {
  addSelf(x, y);
  return x;
}

void multSelf(int &x, int y) {
  x = (int64_t)x * y % mod;
}

int mult(int x, int y) {
  multSelf(x, y);
  return x;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, first, last;
  cin >> n >> first >> last;
  dp[1][1] = 1;
  for (int i = 2, t = 0; i <= n; ++i, t ^= 1) {
    for (int j = 1; j <= i; ++j) {
      if (i == first || i == last) {
        dp[t][j] = add(dp[t ^ 1][j - 1], dp[t ^ 1][j]);
      } else {
        dp[t][j] = add(mult(dp[t ^ 1][j + 1], j), mult(dp[t ^ 1][j - 1], j - (i > first) - (i > last)));
      }
    }
  }
  cout << dp[n & 1][1] << '\n';
  return 0;
}

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