oj.uz

Submission #23897

# Submission time Handle Problem Language Result Execution time Memory
23897 2017-05-27T07:27:51 Z khsoo01 Kangaroo (CEOI16_kangaroo) C++11
100 / 100
 26 ms 33424 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
ll n, s, e, dt[2005][2005];

ll solve (ll X, ll Y) {
	dt[n+1][0] = 1;
	ll ocu = 0;
	for(int i=n;i>=1;i--) {
		for(int j=1;j<=n-i+1;j++) {
			if(i == s) dt[i][j] = dt[i+1][j-X];
			else if(i == e) dt[i][j] = dt[i+1][j-Y];
			else dt[i][j] = (dt[i+1][j-1] * (j - ocu) + dt[i+1][j+1] * j) % mod;
		}
		if(i == s || i == e) ocu++;
	}
	return dt[1][1];
}

int main()
{
	scanf("%lld%lld%lld",&n,&s,&e);
	printf("%lld\n",(solve(0, (n+1)%2) + solve(1, n%2)) % mod);
}

Compilation message

kangaroo.cpp: In function 'int main()':
kangaroo.cpp:23:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld",&n,&s,&e);
                                ^

Subtask #1
6.0 / 6.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
49.0 / 49.0

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