oj.uz

답안 #109085

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
109085 2019-05-04T08:06:50 Z DystoriaX 캥거루 (CEOI16_kangaroo) C++14
100 / 100
 187 ms 47600 KB 
#include <bits/stdc++.h>

using namespace std;

int n, cs, cf;
int dp[2010][2010][3];

const int MOD = 1e9 + 7;

int add(long long a, long long b){
	return (a + b) % MOD;
}

int mul(long long a, long long b){
	return (a * b) % MOD;
}

int main(){
	scanf("%d%d%d", &n, &cs, &cf);

	dp[0][0][0] = 1;

	for(int i = 1; i <= n; i++){
		for(int j = 0; j <= n; j++){
			for(int k = 0; k <= 2; k++){
				if(k > j) continue;

				int v = dp[i - 1][j][k];
				if(i != cf && i != cs){
					dp[i][j - 1][k] = add(dp[i][j - 1][k], mul(v, j - 1));
					dp[i][j + 1][k] = add(dp[i][j + 1][k], mul(v, j + 1 - k));
				} else if (k < 2) {
					dp[i][j][k + 1] = add(dp[i][j][k + 1], v);
					dp[i][j + 1][k + 1] = add(dp[i][j + 1][k + 1], v);
				}
			}
		}
	}

	printf("%d\n", dp[n][1][2]);

	return 0;
}

Compilation message

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

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 6 ms 1536 KB Output is correct
13 Correct 5 ms 1508 KB Output is correct
14 Correct 8 ms 1536 KB Output is correct
15 Correct 5 ms 1636 KB Output is correct
16 Correct 4 ms 1536 KB Output is correct
17 Correct 6 ms 1536 KB Output is correct
18 Correct 5 ms 1408 KB Output is correct
19 Correct 6 ms 1536 KB Output is correct
20 Correct 5 ms 1536 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 6 ms 1536 KB Output is correct
13 Correct 5 ms 1508 KB Output is correct
14 Correct 8 ms 1536 KB Output is correct
15 Correct 5 ms 1636 KB Output is correct
16 Correct 4 ms 1536 KB Output is correct
17 Correct 6 ms 1536 KB Output is correct
18 Correct 5 ms 1408 KB Output is correct
19 Correct 6 ms 1536 KB Output is correct
20 Correct 5 ms 1536 KB Output is correct
21 Correct 20 ms 8104 KB Output is correct
22 Correct 23 ms 8852 KB Output is correct
23 Correct 26 ms 10104 KB Output is correct
24 Correct 138 ms 47600 KB Output is correct
25 Correct 157 ms 47472 KB Output is correct
26 Correct 143 ms 47556 KB Output is correct
27 Correct 187 ms 47324 KB Output is correct
28 Correct 99 ms 32888 KB Output is correct