Tuesday, May 17, 2011

352 - The Seasonal War


#include<iostream>
#include<cstdio>
#include<cstring>
#define M 26
using namespace std;

char graph[M][M];
int eagles,hv,m,n;
int next[8][2]={{-1,0},{-1,-1},{0,-1},{1,1},{1,0},{1,-1},{0,1},{-1,1}};
void DFS_Visit(int,int);

int main()
{
    int i,j,k=1;
    freopen("in.txt","r",stdin);

    while(scanf("%d\n",&n)==1)
    {
        for(i=0;i<n;i++)
            gets(graph[i]);

        eagles=0;
        for(i=0;i<n;i++)
            for(j=0;j<n;j++)
                if(graph[i][j]=='1')
                {
                    DFS_Visit(i,j);
                    eagles++;
                }
        printf("Image number %d contains %d war eagles.\n",k++,eagles);
    }
    return 0;
}

void DFS_Visit(int x,int y)
{
    int i,tx,ty;
    graph[x][y]='0';
    for(i=0;i<8;i++)
    {
        tx=x+next[i][0],ty=y+next[i][1];
        if(tx>=0&&tx<n&&ty>=0&&ty<n&&graph[tx][ty]=='1')
            DFS_Visit(tx,ty);
    }
}

No comments:

Post a Comment

Note: Only a member of this blog may post a comment.