题意:给你一个有向网络,网络中的每条有向边都有一个代价,表示从u向v发信息的代价.现在你要从0号点将信息发到所有的其他点去,问你最小代价是多少.其中如果u与v点可以互达(即属于同一个强连通分量),那么他们之间的通信不需要花代价. 输入保证从0号点能到达所有其他点.
思路:求出图中所有强连通分量,缩点,维护每个缩点的最小值相加
Trick:此题虽然有重边,可是没影响
#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
#include <stack>
using namespace std;
#define maxn 50000+100
#define LL long long
int cas=1,T;
struct Edge
{
int v,cost;
Edge(int v,int c):v(v),cost(c){}
};
vector<Edge>G[maxn];
int pre[maxn];
int lowlink[maxn];
int sccno[maxn];
int dfs_clock,scc_cnt;
int n,m;
const int INF = 1<<29;
stack<int>S;
void dfs(int u)
{
pre[u]=lowlink[u]=++dfs_clock;
S.push(u);
for (int i = 0;i<G[u].size();i++)
{
int v = G[u][i].v;
if (!pre[v])
{
dfs(v);
lowlink[u] = min(lowlink[u],lowlink[v]);
}
else if (!sccno[v])
{
lowlink[u] = min (lowlink[u],pre[v]);
}
}
if (lowlink[u] == pre[u])
{
scc_cnt++;
for (;;)
{
int x = S.top();S.pop();
sccno[x] = scc_cnt;
if (x==u)
break;
}
}
}
void find_scc(int n)
{
dfs_clock=scc_cnt=0;
memset(sccno,0,sizeof(sccno));
memset(pre,0,sizeof(pre));
for (int i = 0;i<n;i++)
if (!pre[i])
dfs(i);
}
int in[maxn];
int out[maxn];
int ans[maxn];
int main()
{
//freopen("in","r",stdin);
// scanf("%d",&T);
while (scanf("%d%d",&n,&m)==2)
{
for (int i = 0;i<=n;i++)
G[i].clear();
memset(in,0,sizeof(in));
memset(ans,0,sizeof(ans));
memset(out,0,sizeof(out));
for (int i = 1;i<=m;i++)
{
int u,v,cost;
scanf("%d%d%d",&u,&v,&cost);
G[u].push_back(Edge(v,cost));
}
find_scc(n);
for (int i = 1;i<=scc_cnt;i++)
{
ans[i]=INF;
}
for (int u = 0;u<n;u++)
for (int j=0;j<G[u].size();j++)
{
int v = G[u][j].v;
if (sccno[u] != sccno[v])
{
ans[sccno[v]]=min(ans[sccno[v]],G[u][j].cost);
}
}
int sum=0;
for (int i = 1;i<=scc_cnt;i++)
if (ans[i]!=INF)
sum+=ans[i];
printf("%d\n",sum);
}
return 0;
}