HDU 1272 小希的迷宫

Problem Description

上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它从房间B走到房间A，为了提高难度，小希希望任意两个房间有且仅有一条路径可以相通（除非走了回头路）。小希现在把她的设计图给你，让你帮忙判断她的设计图是否符合她的设计思路。比如下面的例子，前两个是符合条件的，但是最后一个却有两种方法从5到达8。 

 

 

Input

输入包含多组数据，每组数据是一个以0 0结尾的整数对列表，表示了一条通道连接的两个房间的编号。房间的编号至少为1，且不超过100000。每两组数据之间有一个空行。 
整个文件以两个-1结尾。

 

 

Output

对于输入的每一组数据，输出仅包括一行。如果该迷宫符合小希的思路，那么输出"Yes"，否则输出"No"。

 

 

Sample Input

6 8 5 3 5 2 6 4 5 6 0 0 8 1 7 3 6 2 8 9 7 5 7 4 7 8 7 6 0 0 3 8 6 8 6 4 5 3 5 6 5 2 0 0 -1 -1

 

 

Sample Output

Yes Yes No

 

这道题可以用并查集做 也可以用数据结构树的基本性质做

//并查集
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define N 200005
using namespace std;
int fa[N], flag[N], vis[N];
int find(int x)           
{
    int a = x;
    while (x != fa[x])
    {
        x = fa[x];
    }
    while (a != fa[a])     
    {
        int z = a;
        a = fa[a];
        fa[z] = x;
    }
    return x;
}
int Union(int a, int b) 
{
    int faa = find(a);
    int fab = find(b);
    if (faa != fab)
    {
        fa[faa] = fab;
        return 1;
    }
    else
        return -1;
}
void init(int n)   
{
    for (int i = 1; i <= n; i++)
    {
        fa[i] = i;
    }
}
int main()
{
    int a, b;
    while (1)
    {
        int p = 1, mark = 1, ans = 0;
        memset(flag, 0, sizeof(flag));
        memset(vis, 0, sizeof(vis));
        init(N);
        scanf("%d %d", &a, &b);
        if (a == -1 && b == -1) break;
        else if (!a && !b) 
        {
            printf("Yes\n");
            continue;
        }
        else
        {
            vis[a] = 1;
            vis[b] = 1;
            p = Union(a, b);
            while (1)
            {
                scanf("%d %d", &a, &b);
                if (a == 0 && b == 0) 
                    break;
                vis[a] = 1;
                vis[b] = 1;
                p = Union(a, b);
                if (p == -1)
                {
                    mark = 0;
                }
            }
            if (mark == 0)         
            {
                printf("No\n");
            }
            else               
            {
                for (int i = 1; i < N; i++)
                {
                    if (vis[i] == 0) 
                        continue;
                    int x = find(i);
                    flag[x] = 1;
                }
                for (int i = 1; i < N; i++)
                {
                    if (vis[i] == 1)
                    {
                        if (flag[i] == 1)
                            ans++;
                    }
                }
                if (ans == 1)            
                    printf("Yes\n");
                else
                    printf("No\n");
            }
        }
    }
}

 

树的基本性质：节点数-1等于边数

#include <stdio.h>
#include <string>
#include <string.h>
#include <set>
#include <math.h>
#include <algorithm>
#include<iostream>
const int inf = -0x3fffffff;
using namespace std;
int dp[100001], n, m;
int a, i = 0;

int main()
{
    while (~scanf("%d%d", &n, &m))
    {
        
        if (n == 0 && m == 0)
        {
            printf("Yes\n");
            continue;
        }
        if (n == -1 && m == -1)
            break;
        a = 0;
        set<int>s;//计算点的个数
        while (1)
        {
            a++;
            s.insert(n);
            s.insert(m);
            scanf("%d%d", &n, &m);
            if (n == 0 && m == 0)
            {
                break;
            }
        }
        if (s.size() - 1 == a)
            printf("Yes\n");
        else
            printf("No\n");
    }
}