# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
125563 |
2019-07-06T00:08:23 Z |
tutis |
Kangaroo (CEOI16_kangaroo) |
C++17 |
|
2000 ms |
18572 KB |
/*input
4 2 3
*/
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll modulo = 1000000007;
int sgn(ll x)
{
if (x < 0)
return -1;
if (x > 0)
return 1;
return 0;
}
map<tuple<int, int, int, int>, ll>M;
ll f(int n, int a, int b, int s)
{
if (a == b)
return 0;
if (M.count(make_tuple(n, a, b, s)))
return M[make_tuple(n, a, b, s)];
if (n == 2)
{
if (sgn(b - a) != s)
return 0;
else
return 1;
}
ll ret = 0;
for (int c = 1; c <= n; c++)
{
if (sgn(b - c) == s)
{
ret += f(n - 1, a - (a > b), c - (c > b), -s);
}
}
ret %= modulo;
return M[make_tuple(n, a, b, s)] = ret;
}
int main()
{
int n, a, b;
cin >> n >> a >> b;
ll ans = f(n, a, b, 1) + f(n, a, b, -1);
ans %= modulo;
cout << ans << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
380 KB |
Output is correct |
4 |
Correct |
20 ms |
1016 KB |
Output is correct |
5 |
Correct |
3 ms |
376 KB |
Output is correct |
6 |
Correct |
19 ms |
964 KB |
Output is correct |
7 |
Correct |
17 ms |
888 KB |
Output is correct |
8 |
Correct |
6 ms |
504 KB |
Output is correct |
9 |
Correct |
25 ms |
1144 KB |
Output is correct |
10 |
Correct |
21 ms |
1016 KB |
Output is correct |
11 |
Correct |
9 ms |
632 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
380 KB |
Output is correct |
4 |
Correct |
20 ms |
1016 KB |
Output is correct |
5 |
Correct |
3 ms |
376 KB |
Output is correct |
6 |
Correct |
19 ms |
964 KB |
Output is correct |
7 |
Correct |
17 ms |
888 KB |
Output is correct |
8 |
Correct |
6 ms |
504 KB |
Output is correct |
9 |
Correct |
25 ms |
1144 KB |
Output is correct |
10 |
Correct |
21 ms |
1016 KB |
Output is correct |
11 |
Correct |
9 ms |
632 KB |
Output is correct |
12 |
Execution timed out |
2063 ms |
18572 KB |
Time limit exceeded |
13 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
380 KB |
Output is correct |
4 |
Correct |
20 ms |
1016 KB |
Output is correct |
5 |
Correct |
3 ms |
376 KB |
Output is correct |
6 |
Correct |
19 ms |
964 KB |
Output is correct |
7 |
Correct |
17 ms |
888 KB |
Output is correct |
8 |
Correct |
6 ms |
504 KB |
Output is correct |
9 |
Correct |
25 ms |
1144 KB |
Output is correct |
10 |
Correct |
21 ms |
1016 KB |
Output is correct |
11 |
Correct |
9 ms |
632 KB |
Output is correct |
12 |
Execution timed out |
2063 ms |
18572 KB |
Time limit exceeded |
13 |
Halted |
0 ms |
0 KB |
- |