oj.uz

답안 #400729

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
400729 2021-05-08T15:21:51 Z hltk 캥거루 (CEOI16_kangaroo) C++17
100 / 100
 36 ms 16808 KB 
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
int n, cs, cr, dp[2111][2111];
void mAdd(int &a, int b) { a += b; if (a >= M) a -= M; }
int main() {
	scanf("%d %d %d", &n, &cs, &cr);
	dp[1][1] = 1;
	for (int i = 2; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			if (i == cs || i == cr) {
				dp[i][j] = dp[i - 1][j];
				mAdd(dp[i][j], dp[i - 1][j - 1]);
			} else {
				mAdd(dp[i][j], 1ll * dp[i - 1][j - 1] * (j - (i > cs) - (i > cr)) % M);
				mAdd(dp[i][j], 1ll * dp[i - 1][j + 1] * j % M);
			}
		}
	}
	printf("%d\n", dp[n][1]);
}

Compilation message

kangaroo.cpp: In function 'int main()':
kangaroo.cpp:7:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    7 |  scanf("%d %d %d", &n, &cs, &cr);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 432 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 2 ms 1232 KB Output is correct
13 Correct 2 ms 1100 KB Output is correct
14 Correct 2 ms 1228 KB Output is correct
15 Correct 2 ms 1228 KB Output is correct
16 Correct 2 ms 1228 KB Output is correct
17 Correct 2 ms 1228 KB Output is correct
18 Correct 2 ms 1100 KB Output is correct
19 Correct 2 ms 1196 KB Output is correct
20 Correct 2 ms 1228 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 432 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 2 ms 1232 KB Output is correct
13 Correct 2 ms 1100 KB Output is correct
14 Correct 2 ms 1228 KB Output is correct
15 Correct 2 ms 1228 KB Output is correct
16 Correct 2 ms 1228 KB Output is correct
17 Correct 2 ms 1228 KB Output is correct
18 Correct 2 ms 1100 KB Output is correct
19 Correct 2 ms 1196 KB Output is correct
20 Correct 2 ms 1228 KB Output is correct
21 Correct 6 ms 4556 KB Output is correct
22 Correct 7 ms 4940 KB Output is correct
23 Correct 7 ms 5452 KB Output is correct
24 Correct 36 ms 16736 KB Output is correct
25 Correct 34 ms 16708 KB Output is correct
26 Correct 33 ms 16808 KB Output is correct
27 Correct 35 ms 16640 KB Output is correct
28 Correct 21 ms 12640 KB Output is correct