#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
const int mod = 1000000007;
const int mxn = 201;
int n, x, y;
int dp[mxn][mxn][mxn];
int sol(int n, int x, int y){
int &ret = dp[n][x][y];
if(~ret) return ret;
ret = 0;
for(int i = (n & 1) * (x + 1); i < (n & 1 ? n : x); i++){
if(i != y) (ret += sol(n - 1, i - (n & 1), y - (x < y))) %= mod;
}
return ret;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
memset(dp, -1, sizeof(dp));
for(int i = 0; i < 2; i++)
for(int j = i; j < 2; j++){
dp[2][i][j] = 0;
}
dp[2][1][0] = 1;
cin >> n >> x >> y;
x--, y--;
int ret = (sol(n, x, y) + sol(n, n - x - 1, n - y - 1)) % mod;
cout << ret << endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
21 ms |
32128 KB |
Output is correct |
2 |
Correct |
25 ms |
32180 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
21 ms |
32128 KB |
Output is correct |
2 |
Correct |
25 ms |
32180 KB |
Output is correct |
3 |
Correct |
25 ms |
32128 KB |
Output is correct |
4 |
Correct |
23 ms |
32120 KB |
Output is correct |
5 |
Correct |
24 ms |
32120 KB |
Output is correct |
6 |
Correct |
27 ms |
32128 KB |
Output is correct |
7 |
Correct |
22 ms |
32088 KB |
Output is correct |
8 |
Correct |
24 ms |
32128 KB |
Output is correct |
9 |
Correct |
22 ms |
32120 KB |
Output is correct |
10 |
Correct |
22 ms |
32128 KB |
Output is correct |
11 |
Correct |
22 ms |
32128 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
21 ms |
32128 KB |
Output is correct |
2 |
Correct |
25 ms |
32180 KB |
Output is correct |
3 |
Correct |
25 ms |
32128 KB |
Output is correct |
4 |
Correct |
23 ms |
32120 KB |
Output is correct |
5 |
Correct |
24 ms |
32120 KB |
Output is correct |
6 |
Correct |
27 ms |
32128 KB |
Output is correct |
7 |
Correct |
22 ms |
32088 KB |
Output is correct |
8 |
Correct |
24 ms |
32128 KB |
Output is correct |
9 |
Correct |
22 ms |
32120 KB |
Output is correct |
10 |
Correct |
22 ms |
32128 KB |
Output is correct |
11 |
Correct |
22 ms |
32128 KB |
Output is correct |
12 |
Correct |
715 ms |
32184 KB |
Output is correct |
13 |
Correct |
489 ms |
32180 KB |
Output is correct |
14 |
Correct |
63 ms |
32128 KB |
Output is correct |
15 |
Correct |
707 ms |
32188 KB |
Output is correct |
16 |
Correct |
82 ms |
32128 KB |
Output is correct |
17 |
Correct |
725 ms |
32188 KB |
Output is correct |
18 |
Correct |
228 ms |
32128 KB |
Output is correct |
19 |
Correct |
717 ms |
32128 KB |
Output is correct |
20 |
Correct |
741 ms |
32248 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
21 ms |
32128 KB |
Output is correct |
2 |
Correct |
25 ms |
32180 KB |
Output is correct |
3 |
Correct |
25 ms |
32128 KB |
Output is correct |
4 |
Correct |
23 ms |
32120 KB |
Output is correct |
5 |
Correct |
24 ms |
32120 KB |
Output is correct |
6 |
Correct |
27 ms |
32128 KB |
Output is correct |
7 |
Correct |
22 ms |
32088 KB |
Output is correct |
8 |
Correct |
24 ms |
32128 KB |
Output is correct |
9 |
Correct |
22 ms |
32120 KB |
Output is correct |
10 |
Correct |
22 ms |
32128 KB |
Output is correct |
11 |
Correct |
22 ms |
32128 KB |
Output is correct |
12 |
Correct |
715 ms |
32184 KB |
Output is correct |
13 |
Correct |
489 ms |
32180 KB |
Output is correct |
14 |
Correct |
63 ms |
32128 KB |
Output is correct |
15 |
Correct |
707 ms |
32188 KB |
Output is correct |
16 |
Correct |
82 ms |
32128 KB |
Output is correct |
17 |
Correct |
725 ms |
32188 KB |
Output is correct |
18 |
Correct |
228 ms |
32128 KB |
Output is correct |
19 |
Correct |
717 ms |
32128 KB |
Output is correct |
20 |
Correct |
741 ms |
32248 KB |
Output is correct |
21 |
Runtime error |
63 ms |
64888 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
22 |
Halted |
0 ms |
0 KB |
- |