Cheese Aizu - 0558 DFS

题目链接
factory存储各工厂的信息，进行n次dfs即可

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
const int MAX=0x3f3f3f3f;
const int N=1010;
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
int H,W,n;
char a[N][N];
int vis[N][N];
int ans;
struct Factory{
	int x,y;
}factory[20];
struct Node{
	int x,y,step;
}start,now,Next;
int sx,sy;
int bfs(int num,char c){
	memset(vis,0,sizeof(vis));
	start.x=factory[num].x,start.y=factory[num].y;
	queue<Node> q;
	q.push(start);
	vis[start.x][start.y]=1;
	while(!q.empty()){
		now=q.front();
		q.pop();
		if(a[now.x][now.y]==c){
			return now.step;
		}
		for(int i=0;i<4;i++){
			int nx=now.x+dx[i];
			int ny=now.y+dy[i];
			if(nx>=0&&nx<H&&ny>=0&&ny<W){
				
				 if(vis[nx][ny]==0&&a[nx][ny]!='X'){
					vis[nx][ny]=1;
					Next.x=nx,Next.y=ny,Next.step=now.step+1;
					q.push(Next);
				}
			}
		}
	}
}
int main(){
	cin>>H>>W>>n;
	for(int i=0;i<H;i++){
		for(int j=0;j<W;j++){
			cin>>a[i][j];
		} 
	}
	for(int i=0;i<H;i++){
		for(int j=0;j<W;j++){
			if(a[i][j]=='S'){    //起点存到第0位
				factory[0].x=i;
				factory[0].y=j;
			}else if(isdigit(a[i][j])){
				int num=a[i][j]-'0';
				factory[num].x=i;
				factory[num].y=j;
			}
		}
	}
    char goal='1';
	for(int i=0;i<n;i++){ 
		ans+=bfs(i,goal);   //i是起点，goal是终点 
		goal++;
	}
	cout<<ans<<endl;
}