oj.uz

Submission #545903

# Submission time Handle Problem Language Result Execution time Memory
545903 2022-04-05T16:05:38 Z rainboy Kangaroo (CEOI16_kangaroo) C
100 / 100
 14 ms 304 KB 
#include <stdio.h>
#include <string.h>

#define N	2000
#define MD	1000000007

int main() {
	static int dp[N], dq[N];
	int n, s, f, i, j, k;

	scanf("%d%d%d", &n, &s, &f), s--, f--;
	dp[0] = 1, k = 0;
	for (i = 0; i < n - 1; i++) {
		memset(dq, 0, n * sizeof *dq);
		if (i == s || i == f) {
			k++;
			for (j = 0; j < n; j++)
				dq[j] = (dp[j] + (j + 1 == n ? 0 : (long long) dp[j + 1] * (j + 1))) % MD;
		} else
			for (j = 0; j < n; j++)
				dq[j] = ((j + 1 == n ? 0 : (long long) dp[j + 1] * (j + 1) * (j + k)) + (j == 0 ? 0 : dp[j - 1])) % MD;
		memcpy(dp, dq, n * sizeof *dq);
	}
	printf("%d\n", dp[0]);
	return 0;
}

Compilation message

kangaroo.c: In function 'main':
kangaroo.c:11:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |  scanf("%d%d%d", &n, &s, &f), s--, f--;
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 288 KB Output is correct
4 Correct 0 ms 288 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 284 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 288 KB Output is correct
4 Correct 0 ms 288 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 284 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 292 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 284 KB Output is correct
19 Correct 1 ms 284 KB Output is correct
20 Correct 1 ms 212 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 288 KB Output is correct
4 Correct 0 ms 288 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 284 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 292 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 284 KB Output is correct
19 Correct 1 ms 284 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 212 KB Output is correct
22 Correct 2 ms 288 KB Output is correct
23 Correct 2 ms 212 KB Output is correct
24 Correct 14 ms 304 KB Output is correct
25 Correct 13 ms 288 KB Output is correct
26 Correct 12 ms 212 KB Output is correct
27 Correct 12 ms 304 KB Output is correct
28 Correct 7 ms 212 KB Output is correct