UVa : 11953 (Battleships)



// http://uva.onlinejudge.org/external/119/11953.html
// Runtime: 0.016s
// Tag: Dfs 

// @BEGIN_OF_SOURCE_CODE

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#include <numeric>

#define INF_MAX 2147483647
#define INF_MIN -2147483647
#define pi acos(-1.0)
#define N 1000000
#define LL long long

#define For(i, a, b) for( int i = (a); i < (b); i++ )
#define Fors(i, sz) for( size_t i = 0; i < sz.size (); i++ )
#define Fore(it, x) for(typeof (x.begin()) it = x.begin(); it != x.end (); it++)
#define Set(a, s) memset(a, s, sizeof (a))
#define Read(r) freopen(r, "r", stdin)
#define Write(w) freopen(w, "w", stdout)

int dr [] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dc [] = {0, 1, 1, 1, 0, -1, -1, -1};

using namespace std;

int n;
char mat [100 + 5] [100 + 5];

void dfs (int p, int q)
{
    if ( p < 0 || p == n || q < 0 || q == n || mat [p] [q] == '.' ) return;

    mat [p] [q] = '.';

    for ( int i = 0; i < 8; i += 2 )
        dfs (p + dr [i], q + dc [i]);
}

int main ()
{
    int testCase; scanf ("%d", &testCase);
    int cases = 0;

    while ( testCase-- ) {
        scanf ("%d", &n);

        for ( int i = 0; i < n; i++ ) scanf ("%s", mat [i]);

        int cnt = 0;

        for ( int i = 0; i < n; i++ ) {
            for ( int j = 0; j < n; j++ ) {
                if ( mat [i] [j] == 'x' ) { cnt++;  dfs (i, j); }
            }
        }

        printf ("Case %d: %d\n", ++cases, cnt);
    }

	return 0;
}

// @END_OF_SOURCE_CODE

3 thoughts on “UVa : 11953 (Battleships)

  1. if i understood problem statement correctly, this sample test case is correct and should output 1 as solution , but your AC code give 0 for this one ,
    what’s wrong ?
    i’m so confused for this problem !!

  2. sorry ! everything now is OK with your code and problem statement 🙂

    thanks for your nice testcase 😉

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s