답안 #788616

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
788616	2023-07-20T12:17:30 Z	WLZ	캥거루 (CEOI16_kangaroo)	C++17	100 / 100	26 ms	16060 KB

kangaroo

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

const int MOD = (int) 1e9 + 7;

/** Assumes 1 <= a, b < MOD */
int add(int a, int b) {
  if (a + b >= MOD) return a + b - MOD;
  return a + b;
}

/** Assumes 1 <= a, b < MOD */
int sub(int a, int b) {
  return add(a, MOD - b);
}

/** Assumes 1 <= a, b < MOD */
int mul(int a, int b) {
  return (long long) a * b % MOD;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, cs, cf;
  cin >> n >> cs >> cf;
  vector< vector<int> > dp(n + 1, vector<int>(n + 1, 0));
  dp[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j < n; j++) {
      if (i == cs || i == cf) {
        dp[i][j] = add(dp[i - 1][j], dp[i - 1][j - 1]);
      } else {
        dp[i][j] = add(mul(dp[i - 1][j - 1], j - (i > cs) - (i > cf)), mul(dp[i - 1][j + 1], j));
      }
    }
  }
  cout << dp[n][1] << '\n';
  return 0;
}

Subtask #1

6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct

Subtask #2

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct

Subtask #3

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	1 ms	456 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	1 ms	444 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	468 KB	Output is correct
20	Correct	1 ms	468 KB	Output is correct

Subtask #4

49.0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	1 ms	456 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	1 ms	444 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	468 KB	Output is correct
20	Correct	1 ms	468 KB	Output is correct
21	Correct	3 ms	2004 KB	Output is correct
22	Correct	3 ms	2260 KB	Output is correct
23	Correct	4 ms	2516 KB	Output is correct
24	Correct	24 ms	16060 KB	Output is correct
25	Correct	26 ms	15956 KB	Output is correct
26	Correct	25 ms	15956 KB	Output is correct
27	Correct	26 ms	15808 KB	Output is correct
28	Correct	14 ms	9188 KB	Output is correct