一道有趣的编程题

Problem Description (HDU 6630)
You are given three positive integers $N,x,y$.
Please calculate how many permutations of 1~N satisfies the following conditions (We denote the $i$-th number of a permutation by $p_i$):

1. $p_1=x$
2. $p_N=y$
3. for all $1\le i<N$, $|p_i-p_{i+1}|\le 2$

Input
The first line contains one integer $T$ denoting the number of tests.
For each test, there is one line containing three integers $N,x,y$.

• $1\le T\le 5000$
• $2\le N\le 10^5$
• $1\le x<y\le N$

Output
For each test, output one integer in a single line indicating the answer modulo 998244353.

Sample Input
  3
  4 1 4
  4 2 4
  100000 514 51144
Sample Output
  2
  1
  253604680

// HDU 6630
#include <iostream>
#include <cstdio>
#define ll long long
using namespace std;
const ll MOD = 998244353;
const int maxn = 1e5+5;
int N, x, y;
ll dp[maxn];
void cal(){
	// 从最左端蹦到最右端(按照题目要求)，一共有多少种方法。
	// 记长度为k，每一点都要经历且仅经过一次，且不经过此k个点之外的剩下的点
	dp[1] = 1, dp[2] = 1, dp[3] = 1;
	for(int i = 4; i < maxn; i++)
		dp[i] = (dp[i-1]+dp[i-3])%MOD;
}
int main(){
	// freopen("in.txt", "r", stdin);
	// freopen("fun.out", "w", stdout);
	int T; scanf("%d", &T);
	cal();
	while(T--){
		scanf("%d%d%d", &N, &x, &y);
		if(x > y) swap(x, y);
		int left = x-1, right = N-y, mid = y-x-1;
		if(left != 0 && mid == 0 && right != 0) {
			printf("0\n");
			continue;
		}
		if(mid == 0){
			printf("1\n");
			continue;
		}
		if(left == 0 && right == 0){
			printf("%d\n", (int)dp[N]);
			continue;
		}
		if(left == 0){ // eg. 6 5 1
			printf("%d\n", (int)dp[y-1]);
			continue;
		}
		if(right == 0){
			y = N+1-x;
			printf("%d\n", (int)dp[y-1]);
			continue;
		}
		printf("%d\n", (int)dp[mid]);
	}
	return 0;
}