Lightoj 1012 - Guilty Prince

bfs遍历一遍就行了。

/* ***********************************************
Author        :guanjun
Created Time  :2016/6/15 18:50:31
File Name     :1012.cpp
************************************************ */
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <iomanip>
#include <list>
#include <deque>
#include <stack>
#define ull unsigned long long
#define ll long long
#define mod 90001
#define INF 0x3f3f3f3f
#define maxn 10010
#define cle(a) memset(a,0,sizeof(a))
const ull inf = 1LL << ;
const double eps=1e-;
using namespace std;
priority_queue<int,vector<int>,greater<int> >pq;
struct Node{
    int x,y;
};
struct cmp{
    bool operator()(Node a,Node b){
        if(a.x==b.x) return a.y> b.y;
        return a.x>b.x;
    }
};

bool cmp(int a,int b){
    return a>b;
}
struct node{
    int x,y;
};
char mp[][];
int sx,sy;
int n,m;
int dir[][]={,,,,,-,-,};
int vis[][];
int bfs(){
    queue<node>q;
    cle(vis);
    node u={
        sx,sy
    };
    int ans=;
    q.push(u);
    while(!q.empty()){
        u=q.front();
        ans++;
        q.pop();
        node v;
        for(int i=;i<;i++){
            v.x=u.x+dir[i][];
            v.y=u.y+dir[i][];
            if(v.x<=n&&v.x>=&&v.y<=m&&v.y>=&&mp[v.x][v.y]=='.'&&!vis[v.x][v.y]){
                vis[v.x][v.y]=;
                q.push(v);
            }
        }
    }
    return ans;

}
int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    //freopen("out.txt","w",stdout);
    int T;
    cin>>T;
    for(int t=;t<=T;t++){
        scanf("%d%d",&m,&n);
        for(int i=;i<=n;i++){
            for(int j=;j<=m;j++){
                cin>>mp[i][j];
                if(mp[i][j]=='@')sx=i,sy=j;
            }
        }
        printf("Case %d: %d\n",t,bfs());
    }
    return ;
}