HDU 4478(Where is the King)

题意：比较好懂，略。

思路：看完题面第一反应就是用bfs，然后将每个点记录两个信息（到这点距离为奇数，为偶数），也可以理解为将点拆成两个，那么这样就可以将每个点都能访问两次；然后判断能不能最终到达，判断原点能否能到达的条件是：总时间t为偶数或dis[x][y][1] <= t；然后判断其他点，对于点（i,j），若t为奇数且dis[i][j][1] <= t，则可以访问到；若t为偶数且dis[i][j][0] <= t，则可以访问到；

#include <set>
#include <map>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;

struct node{
	int xx, yy, dd;
}tmp;
const int MAX = 1234567890;
const int N = 110;
int t, n, x, y;
int vis[N][N][2], dis[N][N][2];
int dir[][10] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}, {-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
char g[N][N];

int bfs(int x, int y){
	queue<node> q;
	memset(vis, 0, sizeof(vis));
	tmp.xx = x, tmp.yy = y, tmp.dd = 0;
	q.push(tmp);
	vis[x][y][0] = 1;
	dis[x][y][0] = 0;
	while(!q.empty()){
		node out = q.front();
		q.pop();
		for(int i = 0;i < 8;i++){
			int dirx = out.xx + dir[i][0], diry = out.yy + dir[i][1];
			tmp.xx = dirx, tmp.yy = diry, tmp.dd = out.dd + 1;
			int d = tmp.dd;
			if(dirx < 1||dirx > n||diry < 1||diry > n||g[dirx][diry] == '#')
				continue;
			if(vis[dirx][diry][d % 2])
				continue;
			vis[dirx][diry][d % 2] = 1;
			dis[dirx][diry][d % 2] = d;
			q.push(tmp);			
		}
	}
	int res = 0;
	if(t % 2 == 0||dis[x][y][1] <= t)
		res++;
	for(int i = 1;i <= n;i++)
		for(int j = 1;j <= n;j++){
			if(g[i][j] == '#'||(x == i&&y == j))
					continue;
			if(dis[i][j][1] <= t&&(t & 1))
				res++;
			else if(dis[i][j][0] <= t&& !(t & 1))
				res++;
		}
	return max(res, 1);
}

int main(){
	int T;
	scanf("%d", &T);
	while(T--){
		int i, j, k;
		memset(g, 0, sizeof(g));
		scanf("%d%d%d%d", &n, &t, &x, &y);
		for(i = 1;i <= n;i++)
			for(j = 1;j <= n;j++){
				dis[i][j][0] = MAX;
				dis[i][j][1] = MAX;
				scanf("\n%c", &g[i][j]);
			}
		printf("%d\n", bfs(x, y));
	}	
	return 0;
}