답안 #883438

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
883438	2023-12-05T09:30:16 Z	phoenix0423	캥거루 (CEOI16_kangaroo)	C++17	100 / 100	10 ms	31580 KB

kangaroo

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
// #pragma GCC optimize("Ofast")
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 0, n + 1)
#define SZ(x) (int)(x).size()
#define pb push_back
#define pf push_front
#define eb emplace_back
#define f first
#define s second
#define lowbit(x) x&-x
#define ckmin(a, b) a = min(a, b)
#define ckmax(a, b) a = max(a, b)
#define int long long
const int INF = 1e18;
const int N = 1e9 + 7;
const int maxn = 2005;
ll dp[maxn][maxn];

signed main(void){
	fastio;
	int n, s, t;
	cin>>n>>s>>t;
	dp[0][0] = 1;
	int cnt = 0;
	for(int i = 1; i <= n; i++){
		if(s == i || t == i) cnt++;
		for(int j = 1; j <= i; j++){
			if(s == i || t == i){
				dp[i][j] = (dp[i - 1][j] + dp[i - 1][j - 1]) % N;
			}
			else dp[i][j] = (dp[i - 1][j + 1] * j + dp[i - 1][j - 1] * (j - cnt)) % N;
		}
	}
	cout<<dp[n][1]<<"\n";
}

Subtask #1

6.0 / 6.0

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

Subtask #2

30.0 / 30.0

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

Subtask #3

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2516 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	4444 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Correct	1 ms	4444 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	1 ms	4444 KB	Output is correct
18	Correct	1 ms	4444 KB	Output is correct
19	Correct	1 ms	4444 KB	Output is correct
20	Correct	1 ms	4444 KB	Output is correct

Subtask #4

49.0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2516 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	4444 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Correct	1 ms	4444 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	1 ms	4444 KB	Output is correct
18	Correct	1 ms	4444 KB	Output is correct
19	Correct	1 ms	4444 KB	Output is correct
20	Correct	1 ms	4444 KB	Output is correct
21	Correct	2 ms	10588 KB	Output is correct
22	Correct	2 ms	12632 KB	Output is correct
23	Correct	2 ms	12636 KB	Output is correct
24	Correct	7 ms	31580 KB	Output is correct
25	Correct	10 ms	31580 KB	Output is correct
26	Correct	7 ms	31580 KB	Output is correct
27	Correct	7 ms	31576 KB	Output is correct
28	Correct	5 ms	24924 KB	Output is correct