Connections between cities

最新推荐文章于 2022-11-26 11:07:01 发布

newhonor

最新推荐文章于 2022-11-26 11:07:01 发布

阅读量152

点赞数

CC 4.0 BY-SA版权

分类专栏： LCA Tarjan 模板

本文链接：https://blog.csdn.net/weixin_39132605/article/details/96150342

模板同时被 3 个专栏收录

51 篇文章

订阅专栏

LCA

6 篇文章

订阅专栏

Tarjan

3 篇文章

订阅专栏

本文介绍了一种使用并查集和图论解决特定问题的方法。通过建立图模型，并结合并查集进行连通性判断及求最短路径，实现了对给定问题的有效解决。代码中详细展示了算法实现过程，包括初始化、边的添加、查询处理等关键步骤。

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

http://acm.hdu.edu.cn/showproblem.php?pid=2874

/*#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>*/
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *head, *tail;
inline char Getchar() {
    if (head == tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        tail = (head = buffer) + l;
    }
    return *head++;
 }
inline ll read() {
    ll x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/



const int maxn=1e4+9;
const int maxq=2e6+9;
const int mod=1e9+7;

struct E
{
    int to,cost,nex;
}edge[maxn*2];
struct Q
{
    int q,nex;
    int id;
}query[maxq];

int ans[maxq/2];
int n,m,c;
int fa[maxn];
int head[maxn];
int head_q[maxn];
int tot;
int tot_q;
int vis[maxn];

int dis[maxn];

int Find(int x)
{
    return x==fa[x]?x:fa[x]=Find(fa[x]);
}
void join(int u,int v)
{
    int ju=Find(u);
    int jv=Find(v);
    if(jv!=ju) fa[jv]=ju;
}
void addedge(int u,int v,int w)
{
    edge[tot].to=v;
    edge[tot].cost=w;
    edge[tot].nex=head[u];
    head[u]=tot++;
}
void addquery(int u,int v,int id)
{
    query[tot_q].q=v;
    query[tot_q].nex=head_q[u];
    query[tot_q].id=id;
    head_q[u]=tot_q++;

}
void init()
{
    tot_q=0;
    mem(head_q,-1);
    tot=0;
    mem(head,-1);
}
void Tarjan(int u,int di,int rt)
{
    fa[u]=u;
    dis[u]=di;
    vis[u]=rt;
    for(int i=head[u];i!=-1;i=edge[i].nex)
    {
        int v=edge[i].to;
        if(!vis[v])
        {
            Tarjan(v,di+edge[i].cost,rt);
            join(u,v);
            //fa[v]=u;
        }
    }
    for(int i=head_q[u];i!=-1;i=query[i].nex)
    {
        int v=query[i].q;
        if(vis[v]==rt)
            ans[query[i].id]=dis[u]+dis[v]-2*dis[Find(v)];
    }

}
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    while(~scanf("%d%d%d",&n,&m,&c))
    {
        init();
        int u,v,w;
        for(int i=0;i<m;i++)
        {
            scanf("%d%d%d",&u,&v,&w);
            addedge(u,v,w);
            addedge(v,u,w);
        }

        for(int i=1;i<=c;i++)
        {
            ans[i]=-1;
            int a,b;
            scanf("%d%d",&a,&b);
            addquery(a,b,i);
            addquery(b,a,i);
        }

        for(int i=0;i<=n;i++) vis[i]=0;

        for(int i=1;i<=n;i++)
        {
            if(!vis[i])
            {
                Tarjan(i,0,i);
            }

        }
        for(int i=1;i<=c;i++)
        {
            if(ans[i]==-1) puts("Not connected");
            else printf("%d\n",ans[i]);
        }
    }



    return 0;
}