HDU3072_Intelligence System_tarjan

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#define INF 0x3f3f3f3f
#define rep0(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep_0(i, n) for (int i = n - 1; i >= 0; i--)
#define rep_1(i, n) for (int i = n; i > 0; i--)
#define MAX(x, y) (((x) > (y)) ? (x) : (y))
#define MIN(x, y) (((x) < (y)) ? (x) : (y))
#define mem(x, y) memset(x, y, sizeof(x))
#define MAXN 50000

using namespace std;
typedef long long LL;
struct Edge
{
    int from, to, weight;
    Edge(int f, int t, int w): from(f), to(t), weight(w) {}
};
vector<Edge> edges;
vector<int> g[MAXN];
void init(int n)
{
    edges.clear();
    rep0(i, n)
        g[i].clear();
}

int minN[MAXN];
LL re;
int dfn[MAXN], low[MAXN], tarjanNum, branch[MAXN], tail;
stack<int> st;
bool flag[MAXN];
void tarjan(int u)
{
    flag[u] = true;
    st.push(u);
    low[u] = dfn[u] = ++tarjanNum;
    for (int i = 0; i < g[u].size(); i++)
    {
        Edge e = edges[g[u][i]];

        if (!dfn[e.to])
        {
            tarjan(e.to);

            if (low[e.to] == dfn[e.to])
            {
                minN[branch[e.to]] = e.weight;
                re += e.weight;

            }

            low[u] = MIN(low[u], low[e.to]);
        }
        else if (flag[e.to])
        {
            low[u] = MIN(dfn[e.to], low[u]);
        }
        else if (!flag[e.to] && dfn[e.to] && e.weight < minN[branch[e.to]])
        {
            re += e.weight - minN[branch[e.to]];
            minN[branch[e.to]] = e.weight;

        }


    }
    if (dfn[u] == low[u])
    {
        tail++;
        int temp = st.top();
        while (temp != u)
        {
            branch[temp] = tail;
            st.pop();
            flag[temp] = 0;
            temp = st.top();
        }
        flag[temp] = 0;
        branch[temp] = tail;
        st.pop();

    }
}

int main()
{
    #ifndef ONLINE_JUDGE
        freopen("in.txt", "r", stdin);
    #endif // ONLINE_JUDGE
    int n, m;
    while (~scanf("%d %d", &n, &m))
    {
        init(n);
        int f, t, w;
        while (m--)
        {
            scanf("%d %d %d", &f, &t, &w);
            edges.push_back(Edge(f, t, w));
            g[f].push_back(edges.size() - 1);
        }
        mem(dfn, 0);
        mem(flag, 0);
        mem(minN, 0x3f);
        tail = 0;
        re = 0;
       
        while (!st.empty())
            st.pop();
        tarjanNum = 0;
        tarjan(0);
        printf("%lld\n", re);


    }



    return 0;
}