UVa : 11110 (Equidivisions)



// http://uva.onlinejudge.org/external/111/11110.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 1000
#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)

using namespace std;

int n;
char inp [10000];
int board [100 + 3] [100 + 3];
bool vis [100 + 3];
int contiguous_cnt;
int dr [] = {-1, 0, 1, 0};
int dc [] = {0, 1, 0, -1};

void format (int num)
{
    char *pch;
    pch = strtok (inp, " ");

    while ( pch != NULL ) {
        int c1 = atoi (pch);
        pch = strtok (NULL, " ");
        int c2 = atoi (pch);
        pch = strtok (NULL, " ");
        board [c1 - 1] [c2 - 1] = num;
    }
}

void dfs (int p, int q, int r)
{
    if ( p < 0 || p == n || q < 0 || q == n || board [p] [q] != r ) return;

    board [p] [q] = 0;
    contiguous_cnt++;

    for ( int i = 0; i < 4; i++ ) {
        dfs ( p + dr [i], q + dc [i], r );
    }
}

void print ()
{
    for ( int i = 0; i < n; i++ ) {
        for ( int j = 0; j < n; j++ )
            printf ("%d ", board [i] [j]);
        printf ("\n");
    }
}

int main ()
{
    Read ("in.in");

    while ( scanf ("%d", &n) && n ) {
        getchar ();
        Set (board, 0);

        for ( int i = 1; i < n; i++ ) {
            gets (inp);
            format (i);
        }

        for ( int i = 0; i < n; i++ ) {
            for ( int j = 0; j < n; j++ ) {
                if ( board [i] [j] == 0 ) board [i] [j] = n;
            }
        }

        //print ();

        Set (vis, false);
        bool goodEquidivision = true;

        for ( int i = 0; i < n; i++ ) {
            for ( int j = 0; j < n; j++ ) {
                if ( board [i] [j] == 0 ) continue;
                if ( !vis [board [i] [j]] ) {
                    contiguous_cnt = 0;
                    dfs (i, j, board [i] [j]);
                    if ( contiguous_cnt != n ) goodEquidivision = false;
                }
                else goodEquidivision = false;
            }
        }

        if ( goodEquidivision ) printf ("good\n");
        else printf ("wrong\n");
    }



	return 0;
}

// @END_OF_SOURCE_CODE

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