poj 1308 && hdu1325

判断所给图是不是一颗根树

判定条件：

1.连通

2.节点数 = 边数 + 1

3.入度为0的点只有一个,root

4其他的点都是入度为1的节点

5空树也是树

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string.h>
#include <string>

using namespace std;

#define MAXN 100000 + 10

int degree[MAXN], pre[MAXN], num;
int node[MAXN];
int mx, mi;

int finds(int x)
{
    return x == pre[x] ? x : (pre[x] = finds(pre[x]));
}

void init()
{
    mx = -1, mi = MAXN;
    num = 0;
    for (int i = 0; i < MAXN; i++)
    {
        pre[i] = i;
    }
    memset(degree, 0, sizeof(degree));
    memset(node, 0, sizeof(node));
}

void solve()
{
    int res = 0, root = 0, fnode = 0;

    for (int i = mi; i <= mx; i++)
    {
        if (node[i])
        {
            res++;
            if (degree[i] == 0)
            {
                root++;
            }
            else if (degree[i] == 1)
            {
                fnode++;
            }
        }
    }

    if ((res != num + 1 || root != 1 || fnode != res - 1) && res != 0)
    {
        cout << "is not a tree." << endl;
    }
    else
    {
        cout << "is a tree." << endl;
    }
}

void input()
{
    int cases = 0, u, v;
    init();

    while (cin >> u >> v)
    {
        if (u == 0 && v == 0)
        {
            cout << "Case " << ++cases << " ";
            solve();
            init();
        }
        else if (u == -1 && v == -1)
        {
            break;
        }
        else
        {
            int fu = finds(u), fv = finds(v);
            if (fu != fv)
            {
                num++;
                pre[fu] = fv;
            }
            mx = max(max(u, v), mx);
            mi = min(min(u, v), mi);
            node[u] = node[v] = 1;
            degree[v]++;
        }
    }
}

int main()
{
    input();
    return 0;
}