C - Intelligence System HDU - 3072 （强连通分量+缩点）

题意（记不大清了）：给定n个点，m条带权有向边，要求从0点出发，能够到达每个点并且费用最小。如果某些点之间可以两两互相到达，则不计费用

思路：

• 先求强连通分量，缩点，因为在同一个分量里的不计费用。这里的得到的DAG图一定是连通的，因为题目说保证有解
• 剩下的问题是如果求出这个DAG图的最小总费用，思路是找每个点的入度，从入度中挑选出权值最小的边即可。可以保证得到的图仍是连通的

代码：

//#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<stack>
#include<vector>
#define rep(i,e) for(int i=0;i<(e);++i)
#define rep1(i,e) for(int i=1;i<=(e);++i)
#define repx(i,x,e) for(int i=(x);i<=(e);++i)
#define pii pair<int,int>
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define mset(var,val) memset(var,val,sizeof(var))
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define IOS ios::sync_with_stdio(false);cin.tie(0)

using namespace std;

#ifdef LOCAL
template<typename T>
void dbg(T t){
    cout<<t<<" "<<endl;
}
template<typename T, typename... Args>
void dbg(T t, Args... args){
    cout<<t<<" ";dbg(args...);
}


#else
#define dbg(...)
#endif // local
typedef long long ll;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int mod = 1e9+7;
const int N = 500+10;
typedef long long ll;
const int maxn = 5e4+10;
const int maxm = 1e5+10;

struct node{
    int v,w,next;
}edge[maxm];

int low[maxn],dfn[maxn],sccno[maxn],dfn_cnt,scc_cnt;
stack<int>S;
int cnt;
int vis[maxn];
int head[maxn];
void add(int u,int v,int w)
{
    edge[++cnt].v = v;
    edge[cnt].next = head[u];
    edge[cnt].w = w;
    head[u] = cnt;
}

void tarjan(int u)
{
    low[u] = dfn[u] = ++dfn_cnt;
    S.push(u);
    for(int i = head[u]; i != -1; i = edge[i].next)
    {
        int v = edge[i].v;
        if(!dfn[v])
        {
            tarjan(v);
            low[u] = min(low[u],low[v]);
        }else if(!sccno[v])
        {
            low[u] = min(dfn[v],low[u]);
        }
    }
    if(dfn[u] == low[u])
    {
        ++scc_cnt;
        for(;;){
            int x = S.top(); S.pop();
            sccno[x] = scc_cnt;
            if(x == u) break;
        }
    }
}

void work()
{
    int n,m,x,y,w;
    while(~scanf("%d%d",&n,&m))
    {
        for(int i = 0; i <= n; i++)
        {
            low[i] = dfn[i] = sccno[i] = 0;
            head[i] = -1;
            vis[i] = inf;
        }
        scc_cnt = dfn_cnt = cnt = 0;
        for(int i = 0; i < m; i++)
        {
            scanf("%d%d%d",&x,&y,&w);
            add(x,y,w);
        }
        for(int i = 0; i < n; i++)
            if(!dfn[i])
                tarjan(i);
        //dbg(scc_cnt,"*");
        ll res = 0;
        for(int i = 0; i < n; i++)
        {
            for(int j = head[i]; j != -1; j = edge[j].next)
            {
                int v = edge[j].v;
                if(sccno[v] != sccno[i])
                {
                    vis[sccno[v]] = min(vis[sccno[v]],edge[j].w);
                }
            }
        }
        vis[sccno[0]] = 0;
        for(int i = 1; i <= scc_cnt; i++)
        {
            res += vis[i];
        }
        printf("%lld\n",res);
    }
}

int main()
{
#ifdef LOCAL
    freopen("in.txt","r",stdin);
#endif
    //IOS;
    work();
    return 0;
}