云智计划_数据结构_并查集

//https://www.luogu.com.cn/problem/P1111
//P1111 修复公路
#include<iostream>
#include<algorithm>
#define maxm 100010
#define maxn 1010
using namespace std;
struct EDGE
{
    int u,v,tim;
}edge[maxm];
int tot;
void add(int u,int v,int tim)
{
    edge[++tot].v=v;
    edge[tot].tim=tim;
    edge[tot].u=u;
}
bool rule(EDGE a,EDGE b)
{
    return a.tim<b.tim;
}
int fa[maxn];
int fd(int x){return(fa[x]==x?x:fa[x]=fd(fa[x]));}
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,z;
        cin>>x>>y>>z;
        add(x,y,z);
    }
    sort(edge+1,edge+tot+1,rule);
    for(int i=1;i<=n;i++)fa[i]=i;
    int ans=0;
    for(int i=1;i<=m;i++)
    {
        int u=edge[i].u,v=edge[i].v;
        if(fd(u)==fd(v))continue;
        ans=edge[i].tim;
        fa[fd(u)]=fd(v);
    }
    int root=fd(1);
    for(int i=2;i<=n;i++)if(fd(i)!=root)return cout<<-1,0;
    cout<<ans;
    return 0;
}

//https://www.luogu.com.cn/problem/P1955
//P1955 [NOI2015] ³ÌÐò×Ô¶¯·ÖÎö
#include<iostream>
#include<algorithm>
#include<cstring>
#define maxn 100010
using namespace std;
struct REQU
{
    int x,y,relation;
}a[maxn];
int cre[2*maxn];//一定别忘了开二倍！！！！因为每条指令两个数字
int tot,u[maxn],v[maxn];//赛博半离线
int fa[2*maxn];
int find(int x){return (fa[x]==x?x:fa[x]=find(fa[x]));}
void marge(int x,int y)
{
    x=find(x);y=find(y);
    if(x==y)return;
    fa[x]=y;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        tot=0;
        memset(a,0,sizeof(a));
        memset(cre,0,sizeof(cre));
        cin>>n;
        for(int i=1;i<=n;i++)cin>>a[i].x>>a[i].y>>a[i].relation;

        //*+*+*+*+*+*+*离散化Discretization*+*+*+*+*+*+*
        for(int i=1;i<=n;i++)cre[i]=a[i].x;
        for(int i=1;i<=n;i++)cre[i+n]=a[i].y;
        sort(cre+1,cre+n+n+1);
        int m=unique(cre+1,cre+n+n+1)-cre-1;
        //其实unique是有返回值的，返回值是去重之后的尾地址，减去头地址就是个数
        for(int i=1;i<=n;i++)a[i].x=lower_bound(cre+1,cre+m+1,a[i].x)-cre;//是m不是n+n
        for(int i=1;i<=n;i++)a[i].y=lower_bound(cre+1,cre+m+1,a[i].y)-cre;
        //lower:大于等于，upper:大于
        //我们这里是找等于
        //*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*+*

        for(int i=1;i<=m;i++)fa[i]=i;
        for(int i=1;i<=n;i++)
        {
            if(a[i].relation==0)
            {
                u[++tot]=a[i].x;
                v[tot]=a[i].y;
                continue;
            }
           marge(a[i].x,a[i].y);
        }
        bool yes=1;
        for(int i=1;i<=tot;i++)
            if(find(u[i])==find(v[i]))
                yes=0;
        if(yes==1)cout<<"YES\n";
        else cout<<"NO\n";
    }
    return 0;
}

//https://www.luogu.com.cn/problem/P1197
//P1197 [JSOI2008] ÐÇÇò´óÕ½
#include<iostream>
#include<vector>
#define maxm 200010
#define maxn 400020
using namespace std;
int n,m,k;
int u[maxm],v[maxm];
bool vis[maxn];
int a[maxn];
int fa[maxn];
int ans[maxn];
vector <int> mp[maxn];
int find(int x){return (fa[x]==x?x:fa[x]=find(fa[x]));}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)cin>>u[i]>>v[i];
    cin>>k;
    for(int i=1;i<=k;i++)cin>>a[i];
    for(int i=1;i<=k;i++)vis[a[i]]=1;
    for(int i=0;i<n;i++)fa[i]=i;
    int block=n-k;
    for(int i=1;i<=m;i++)
    {
        int x=u[i],y=v[i];
        if(vis[x]==1)
        {
            mp[x].push_back(y);
        }
        if(vis[y]==1)
        {
            mp[y].push_back(x);
        }
        if(vis[x]==0&&vis[y]==0)
        {
            x=find(x);y=find(y);
            if(x!=y)
            {
                block--;
                fa[y]=x;
            }
        }
    }
    ans[k+1]=block;
    for(int i=k;i>=1;i--)
    {
        int p=a[i];
        vis[p]=0;
        block++;
        for(auto to:mp[p])
        {
            if(vis[to]==1)continue;
            if(find(to)!=find(p))
            {
                block--;
                fa[find(to)]=find(p);
            }
        }
        ans[i]=block;
    }
    for(int i=1;i<=k+1;i++)cout<<ans[i]<<"\n";
    return 0;
}

嘻嘻

//https://www.luogu.com.cn/problem/P1196
//P1196 [NOI2002] ÒøºÓÓ¢ÐÛ´«Ëµ
#include<iostream>
#define maxn 30010
using namespace std;
int fa[maxn],sz[maxn],tag[maxn];
int find(int x)
{
    if(fa[x]==x)return x;//递归·终止条件
    int f=find(fa[x]);//先全部跑一遍，让每一个递归嵌套内的f=根节点
    tag[x]+=tag[fa[x]];//从根节点往下一层一层累加
    return fa[x]=f;//最后直接指向根节点
}
int main()
{
    for(int i=1;i<=30000;i++)fa[i]=i,sz[i]=1;
    int t;
    cin>>t;
    while(t--)
    {
        int a,b;
        char c;
        cin>>c>>a>>b;
        if(c=='M')
        {
            a=find(a);
            b=find(b);
            tag[a]=sz[b];
            sz[b]+=sz[a];
            fa[a]=b;
        }
        else
        {
            if(find(a)!=find(b))cout<<-1<<"\n";
            else
            {
                int x=tag[a],y=tag[b];
                if(x>y)swap(x,y);
                cout<<y-x-1<<"\n";
            }
        }
    }
    return 0;
}