oj.uz

Submission #208282

# Submission time Handle Problem Language Result Execution time Memory
208282 2020-03-10T14:00:07 Z dolphingarlic Kangaroo (CEOI16_kangaroo) C++14
100 / 100
 28 ms 31608 KB 
#include <cstdio>
using namespace std;

const long long MOD = 1e9 + 7;

long long dp[2001][2001];

int main() {
	int n, a, b;
	scanf("%d %d %d", &n, &a, &b);
	dp[0][0] = 1;
	for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) {
		if (i == a || i == b)
			dp[i][j] = (dp[i - 1][j] + dp[i - 1][j - 1]) % MOD;
		else
			dp[i][j] = (dp[i - 1][j + 1] * j + dp[i - 1][j - 1] * (j - (i > a) - (i > b))) % MOD;
	}
	printf("%lld\n", dp[n][1]);
	return 0;
}

Compilation message

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

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 4 ms 480 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 500 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 4 ms 480 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 500 KB Output is correct
12 Correct 5 ms 1400 KB Output is correct
13 Correct 5 ms 1400 KB Output is correct
14 Correct 5 ms 1400 KB Output is correct
15 Correct 5 ms 1400 KB Output is correct
16 Correct 5 ms 1404 KB Output is correct
17 Correct 7 ms 1400 KB Output is correct
18 Correct 5 ms 1272 KB Output is correct
19 Correct 5 ms 1400 KB Output is correct
20 Correct 5 ms 1400 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 4 ms 480 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 500 KB Output is correct
12 Correct 5 ms 1400 KB Output is correct
13 Correct 5 ms 1400 KB Output is correct
14 Correct 5 ms 1400 KB Output is correct
15 Correct 5 ms 1400 KB Output is correct
16 Correct 5 ms 1404 KB Output is correct
17 Correct 7 ms 1400 KB Output is correct
18 Correct 5 ms 1272 KB Output is correct
19 Correct 5 ms 1400 KB Output is correct
20 Correct 5 ms 1400 KB Output is correct
21 Correct 8 ms 6264 KB Output is correct
22 Correct 9 ms 6904 KB Output is correct
23 Correct 9 ms 7800 KB Output is correct
24 Correct 27 ms 31608 KB Output is correct
25 Correct 27 ms 31608 KB Output is correct
26 Correct 28 ms 31608 KB Output is correct
27 Correct 27 ms 31480 KB Output is correct
28 Correct 20 ms 23800 KB Output is correct