zoukankan      html  css  js  c++  java
  • quick-find

    #include <stdio.h>
    #include <malloc.h>
    #include <stdbool.h>
    #include <string.h>
    
    struct UnionFindSet
    {
        int *ID;
        int GroupSum;
        int WeightOriginalTotal;
    };
    
    struct UnionFindSet* UnionFindSetInit(int WeightTotal)
    {
        struct UnionFindSet *UFSet = malloc(sizeof(struct UnionFindSet));
        
        UFSet -> GroupSum = WeightTotal;
        UFSet -> WeightOriginalTotal = WeightTotal;
        
        UFSet -> ID = malloc(WeightTotal*sizeof(int));
        
        int i;
        for(i = 0;i < WeightTotal;i ++)
        {
            UFSet -> ID[i] = i;
        }
        
        return UFSet; 
    }
    
    int UnionFindSetFind(struct UnionFindSet* UFSet,int WeightNum)
    {
        if(WeightNum>UFSet -> WeightOriginalTotal-1 || WeightNum<0)
        {
            return -1;
        }
        return UFSet -> ID[WeightNum];
    }
    
    //return 1 if two are in the same weight,return 0 if everything ok,return -1 if ERROR
    int UnionFindSetUnion(struct UnionFindSet* UFSet,int Weight_1,int Weight_2)
    {
        int ID_1 = UnionFindSetFind(UFSet,Weight_1);
        int ID_2 = UnionFindSetFind(UFSet,Weight_2);
        
        if(ID_1 == -1 || ID_2 == -1)
        {
            return -1;
        }
        if(ID_1 == ID_2)
        {
            return 1;
        }
        
        int i;
        
        for(i = 0;i < UFSet -> WeightOriginalTotal;i ++)
        {
            if(UFSet -> ID[i] == ID_1)
            {
                UFSet -> ID[i] = ID_2;
            }
        }
        UFSet -> GroupSum --;
        return 0;
    }
    
    bool UnionFindSetIsConnected(struct UnionFindSet* UFSet,int Weight_1,int Weight_2)
    {
        return (UnionFindSetFind(UFSet,Weight_1) == UnionFindSetFind(UFSet,Weight_2));
    }
    
    int main()
    {
        int i;
        
        struct UnionFindSet *UFSet = UnionFindSetInit(10);
        UnionFindSetUnion(UFSet,4,3);
        UnionFindSetUnion(UFSet,3,8);
        UnionFindSetUnion(UFSet,6,5);
        UnionFindSetUnion(UFSet,9,4);
        UnionFindSetUnion(UFSet,2,1);
        UnionFindSetUnion(UFSet,8,9);
        UnionFindSetUnion(UFSet,5,0);
        UnionFindSetUnion(UFSet,7,2);
        UnionFindSetUnion(UFSet,6,1);
        UnionFindSetUnion(UFSet,1,0);
        UnionFindSetUnion(UFSet,6,7);
        
        bool Result = UnionFindSetIsConnected(UFSet,0,1);
        printf("%d
    ",Result);
        return 0;
    }
  • 相关阅读:
    【CF875E】Delivery Club 二分+线段树
    【CF316G3】Good Substrings 后缀自动机
    【BZOJ3413】匹配 离线+后缀树+树状数组
    【BZOJ2658】[Zjoi2012]小蓝的好友(mrx) 平衡树维护笛卡尔树+扫描线
    【BZOJ5133】[CodePlus2017年12月]白金元首与独舞 矩阵树定理
    【LOJ6254】最优卡组 堆(模拟搜索)
    面试问题总结
    Nginx基本配置
    Visual Studio Enterprise 2015下载 Update3
    .net 中生成二维码的组件
  • 原文地址:https://www.cnblogs.com/Asurudo/p/9427239.html
Copyright © 2011-2022 走看看