采蘑菇

#include
#include
#include
#include
using namespace std;
queue  > q;
int map[105][105];
int visit[105][105];
int n,m,t;
int ans;
int ans1;
int dir[4][2]={-1,0,0,-1,1,0,0,1};
void  bfs(int a,int b){
    memset(visit,0,sizeof(visit));
    visit[a][b]=1;
    while(!q.empty())
       q.pop();
    q.push(make_pair(a,b));
    int hp=0,tp=1,lc=1;
    while(!q.empty()){
        hp++;
        pair tmp;
        tmp=q.front();
        q.pop();
        //c//out<=0&&jj>=0&&ii>n>>m>>t){
        printf("Case %d:\n",ca++);
        ans=0;
        ans1=-1;
        for(int i=0;i>map[i][j];
         for(int i=0;i