UVa 11953 - Battleships

/*
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
// 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 = 105;

char adj[high][high];
int N;

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

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

    if(adj[x][y] == 'x' || adj[x][y] == '@') adj[x][y] = '.'; // LOL :P

    //cnt+=1;

    DFS(x , y+1); // horizontal
    DFS(x , y-1); // horizontal
    DFS(x+1 , y); // vertical
    DFS(x-1 , y); // vertical
}

int main()
{
    fast;
    int test , tc=0 , i, j;
    //cin >> test;
    sf("%d", &test);
    while(test--)
    {
        //cin >> N;
        sf("%d", &N);

        for(i=0; i<N; i++)
        {
            sf("%s", &adj[i]);
        }

        int cnt = 0;

        for(i=0; i<N; i++)
        {
            for(j=0; j<N; j++)
            {
                if(adj[i][j] == 'x')
                {
                    cnt+=1;
                    DFS(i , j);
                }
            }
        }

        //cout << "Case " << ++tc << ": " << cnt << "\n";
        pf("Case %d: %d\n", ++tc, cnt);

    }

    return 0;
}

Comments

Popular posts from this blog

SPOJ-CMG - Collecting Mango

LightOJ 1009 - Back to Underworld

LeetCode Palindrome Number