ZOJ 1430 The Erythea Campaign(最短路)

普通的最短路算法都可以.

边算边判断能否连通.

#include <iostream>
#include <cstdio>
#include <memory.h>
#include <functional>
#include <vector>
#include <algorithm>
#include <queue>
#define pii pair<int,int>
using namespace std;
const int maxn = 81;

char grid[maxn][maxn];
bool inq[maxn * maxn], bdr[maxn][maxn], vis[maxn][maxn];
int di[] = {-1, 1, 0, 0}, dj[] = {0, 0, -1, 1}, n, m;
int ddi[] = {-1, 0, -1, -1}, ddj[] = {-1, -1, -1, 0};
int dis[maxn * maxn], d[maxn][maxn];
int getDis(int p){
	memset(vis,0,sizeof(vis));
	queue<pii> q;
	q.push(pii(p,0));
	while (q.size()){
		pii t = q.front(); q.pop();
		int ci = t.first / (m + 1) , cj = t.first % (m + 1);
		if(bdr[ci][cj])return t.second;
		for (int i = 0; i < 4; ++i){
			int ni = ci + di[i], nj = cj + dj[i];
			if(ni >= 0 && ni <=n && nj >= 0 && nj <=m && !vis[ni][nj]){
				vis[ni][nj] = 1;
				q.push(pii(ni * (m + 1) + nj, t.second + 1));
			}
		}
	}
}
inline bool leagal(int ci,int cj, int i){
	int cnt = 0;
	if(i == 0 || i == 1){
		cnt += grid[ci][cj] == '1';
		cnt += grid[ci][cj + 1] == '1';
	}else{
		cnt += grid[ci][cj] == '1';
		cnt += grid[ci + 1][cj] == '1';
	}
	return cnt != 2;
}
int spfa(int s, int e){
	memset(dis, 0X20, sizeof(dis));
	memset(inq, 0, sizeof(inq));
	dis[s] = (m + n) - getDis(s);
	queue<int> q;
	q.push(s);
	inq[s] = 1;
	while (q.size()){
		int t = q.front();q.pop();
		int ci = t / (m + 1), cj = t % (m + 1);
		inq[t] = 0;
		for (int i = 0; i < 4; ++i){
			int ni = ci + ddi[i], nj = cj + ddj[i];
			if(leagal(ni, nj, i)){
				ni = ci + di[i], nj = cj + dj[i];
				if(ni >= 0 && ni <=n && nj >= 0 && nj <=m){
					int dv = d[ni][nj];
					int np = ni * (m + 1) + nj;
					if(dv == -1){
						d[ni][nj] = dv = getDis(np);
					}
					dv = (m + n) - dv;
					if(dis[np] > dis[t] + dv){
						dis[np] = dis[t] + dv;
						if(!inq[np]){
							inq[np] = 1;
							q.push(np);
						}
					}
				}
			}
		}
	}
	return dis[e];
}
int dijkstra(int s, int e){
	memset(dis, 0X20, sizeof(dis));
	memset(inq, 0, sizeof(inq));
	dis[s] = (m + n) - getDis(s);
	priority_queue<pii,vector<pii >, greater<pii > > q;
	q.push(pii(0, s));
	while (q.size()){
		pii t = q.top();q.pop();
		int u = t.second;
		int ci = u / (m + 1), cj = u % (m + 1);
		if(inq[u])continue;
		inq[u] = 1;
		for (int i = 0; i < 4; ++i){
			int ni = ci + ddi[i], nj = cj + ddj[i];
			if(leagal(ni, nj, i)){
				ni = ci + di[i], nj = cj + dj[i];
				if(ni >= 0 && ni <=n && nj >= 0 && nj <=m){
					int dv = d[ni][nj];
					int np = ni * (m + 1) + nj;
					if(dv == -1){
						d[ni][nj] = dv = getDis(np);
					}
					dv = (m + n) - dv;
					if(dis[np] > dis[u] + dv && !inq[np]){
						dis[np] = dis[u] + dv;
						q.push(pii(dis[np], np));
					}
				}
			}
		}
	}
	return dis[e];
}
int main(){
	int t;
	scanf("%d", &t);
	while (t--){
		scanf("%d %d", &n, &m);
		int si, sj, ei, ej;
		scanf("%d %d %d %d\n", &si, &sj, &ei, &ej);
		memset(bdr, 0, sizeof(bdr));
		for (int i = 0; i < n; ++i){
			for (int j = 0; j < m; ++j){
				scanf("%c",&grid[i][j]);
				if(grid[i][j] == '1'){
					bdr[i][j] = 1 ;
					if(i + 1 <= n)
						bdr[i + 1][j] = 1;
					if(j + 1 <= m)
						bdr[i][j + 1] = 1;
					if(i + 1 <= n && j + 1 <= m)
						bdr[i + 1][j + 1] = 1;
				}
			}
			getchar();
		}
		memset(d,-1,sizeof(d));
		int ans = dijkstra(si * (m + 1) + sj, ei * (m + 1) + ej);
		if(ans == 0X20202020){
			printf("no solution\n");
		}else{
			printf("%d\n",ans);
		}
	}
	return 0;
}