POJ 1611 The Suspects

Vontroy — Wed, 28 Jul 2010 23:09:00 GMT

#include <iostream>
#include <cstdio>

const int maxn = 30000 + 5;

using namespace std;

int father[maxn],rank[maxn];

void init( int n )
{
    for ( int i = 0; i < n; i++)
    {
        father[i] = i;
        rank[i] = 1;
    }
}

int findSet( int n )
{
    if(father[n] != n)
        father[n] = findSet(father[n]);
    return father[n];
}

void Union( int a, int b )
{
    int x = findSet( a );
    int y = findSet( b );

    if( x == y ) return ;
    if( rank[x] >= rank[y] )
    {
        father[y] = x;
        rank[x] += rank[y];
    }
    else
    {
        father[x] = y;
        rank[y] += rank[x];
    }
}

int main()
{
    int m, n, count, temp, first;
    while( ~scanf("%d%d", &n, &m ) && n )
    {
        init(n);
        while( m-- )
        {
            scanf("%d%d", &count, &first );
            for( int i = 1; i < count ;i ++)
            {
                scanf("%d", &temp);
                Union( first, temp );
            }
        }
        printf("%d\n",rank[findSet(0)]);
    }
    return 0;
}

Vontroy 2010-07-29 07:09 发表评论

HDU 1198 Farm Irrigation

Vontroy — Wed, 28 Jul 2010 23:04:00 GMT

#include<iostream>
using namespace std;

int bin[2500];

int find(int x)
{return x==bin[x]?x:find(bin[x]);}

void merge(int x,int y)
{
    x=find(x);
    y=find(y);
    if(x!=y) bin[x]=y;
}

int main()
{
    int a[11] = {9, 3, 12, 6, 5, 10, 11, 13, 14, 7, 15}, m, n, i, j, map[50][50], total;
    char c;
    while(scanf("%d %d", &m, &n), m != -1 || n != -1){
        getchar();
        for(i = 0; i < m; ++i){
            for(j = 0; j < n; ++j){
                scanf("%c", &c);
                map[i][j] = c - 65;
            }
            getchar();
        }
        for(i = 0; i < m * n; ++i) bin[i] = i;
        for(i = 0; i < m; ++i)
            for(j = 0; j < n; ++j){
                if(i + 1 < m && a[map[i][j]] & 0x04 && a[map[i + 1][j]] & 0x01)
                    merge(i * n + j, i * n + n + j);
                if(j + 1 < n && a[map[i][j]] & 0x02 && a[map[i][j + 1]] & 0x08)
                    merge(i * n + j, i * n + j + 1);
            }
        for(total = 0, i = 0; i < m * n; ++i)
            if(i == bin[i]) ++total;
        printf("%d\n", total);
    }
    return 0;
}

Vontroy 2010-07-29 07:04 发表评论

C++博客-Vontroy-随笔分类-并查集

POJ 1611 The Suspects

HDU 1198 Farm Irrigation