NBUT1218 You are my brother(弱化版带权并查集)

最新推荐文章于 2022-07-22 18:55:40 发布

原创最新推荐文章于 2022-07-22 18:55:40 发布 · 450 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#并查集

【并查集/欧拉路/最小生成树】专栏收录该内容

43 篇文章

订阅专栏

本文介绍了一个简单的算法，用于解决特定的家族关系查询问题。通过构建并查集来确定两个人之间的辈分关系，如兄弟、兄长或弟弟。该算法适用于处理多组数据，并能有效地找出两个个体间的血缘关系。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

[1218] You are my brother
时间限制: 1000 ms　内存限制: 131072 K
问题描述
Little A gets to know a new friend, Little B, recently. One day, they realize that they are family 500 years ago. Now, Little A wants to know whether Little B is his elder, younger or brother.
输入
There are multiple test cases.
For each test case, the first line has a single integer, n (n<=1000). The next n lines have two integers a and b (1<=a,b<=2000) each, indicating b is the father of a. One person has exactly one father, of course. Little A is numbered 1 and Little B is numbered 2.
Proceed to the end of file.
输出
For each test case, if Little B is Little A’s younger, print “You are my younger”. Otherwise, if Little B is Little A’s elder, print “You are my elder”. Otherwise, print “You are my brother”. The output for each test case occupied exactly one line.
样例输入

样例输出
```
You are my elder
You are my brother
```
提示
```
无
```
来源
```
辽宁省赛2010
```
操作

思路：

给了一个血缘关系序列，让你判断1和2谁的辈分大，加入并查集的时候顺带的求个权值比较一下就好

代码：

#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <stack>
#include <cmath>
#include <set>
#include <queue>
#include <vector>
#include <map>
#include <algorithm>
#define mem(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
#define N 10000+20
#define mod 10007
#define M 1000000+10
#define LL long long
using namespace std;
int pre[3010],x,y;
void init()
{
    for(int i=1; i<=2010; i++)
        pre[i]=i;
}
int find(int x)
{
    int num=0;
    while(x!=pre[x])
    {
        x=pre[x];
        num++;
    }
    return num;
}
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        init();
        for(int i=1; i<=n; i++)
        {
            scanf("%d%d",&x,&y);
            pre[x]=y;
        }
        int a=find(1);
        int b=find(2);
        if(a>b)
            printf("You are my elder\n");
        else if(a<b)
            printf("You are my younger\n");
        else if(a==b)
            printf("You are my brother\n");
    }
    return 0;
}