UVa 352 - The Seasonal War

/*
Lionel Messi is such a player that you may catch him, you may touch him, you may feel him
and definitely you may Love him.
Lionel Messi is Messi. A little Magician in this World.

*/

// Accepted

#include<bits/stdc++.h>

using namespace std;

#define fast ios_base::sync_with_stdio(0)
#define bfast cin.tie(0)
#define outs(x) cout << x << " "
#define outn(x) cout << x << "\n"
#define sf scanf
#define pf printf
#define nl puts("")
#define psb push_back
#define mset(c,v) memset(c , v , sizeof c)
#define loop0(n) for(int i=0; i<n; i++)
#define loop1(n) for(int i=1; i<=n; i++)
#define mpair(x , y) make_pair(x , y)
#define all(x) x.begin(), x.end()
#define pi acos(-1.0)
#define psb push_back

typedef unsigned long long ull;
typedef long long LL;
typedef vector<int>vii;
typedef vector<LL>vll;
typedef vector<string>vs;
typedef map<int, int>mpii;
typedef map<string, int>mpsi;
typedef map<char, int>mpci;
typedef map<LL, LL>mpll;

const int mod = 1000007;
const int high = 30;

char adj[high][high];
bool visited[high][high];

int dir_x[4] = {-1, 1, 0 , 0}, dir_y[4] = {0, 0 , -1, 1} , n;

void DFS(int x , int y)
{
    if(x<0 || x >= n || y<0 || y>=n) return;

    if(adj[x][y] != '1') return;

    if(adj[x][y] == '1') adj[x][y] = '0';

    visited[x][y] = true;

    DFS(x, y+1);
    DFS(x, y-1);
    DFS(x+1, y);
    DFS(x-1, y);
    DFS(x+1, y+1);
    DFS(x-1, y+1);
    DFS(x+1, y-1);
    DFS(x-1, y-1);
}

int main()
{
    fast;
    int i , j, tc=0;
    while(cin >> n)
    {
        mset(adj, '0');
        mset(visited , false);

        for(i=0; i<n; i++)
        {
            for(j=0; j<n; j++)
            {
                cin >> adj[i][j];
            }
        }

        int cnt = 0;

        for(i=0; i<n; i++)
        {
            for(j=0; j<n; j++)
            {
                if(!visited[i][j] && adj[i][j] == '1')
                {
                    cnt+=1;

                    DFS(i , j);
                }
            }
        }

        //cout << cnt << "\n";
        cout << "Image number " << ++tc << " contains " << cnt << " war eagles.\n";
    }

    return 0;
}

Comments

Popular posts from this blog

SPOJ-CMG - Collecting Mango

LightOJ 1009 - Back to Underworld

LeetCode Palindrome Number