HDU - 1827 Summer Holiday 强连通分量Tarjan+缩点

题意：中文题，传递的最小费用

求出所有的强连通分量， 然后缩点， 最后看所有入度为0的强连通分量，这些是要通知的， 选出一个费用最少的求和就好了

链接：hdu- 1827

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#define INF 0x3f3f3f3f
#define ll long long

using namespace std;

const int inf = 0x3f3f3f3f;
const int maxn = 20005;
const int maxm = 100005;

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

int sstack[maxn], belong[maxn];
int dfn[maxn], low[maxn];
int head[maxn];
bool instack[maxn];
int cnt, top, tot, scnt;
int n, m;

int in[maxn], out[maxn];
int incnt, outcnt;

int minn[maxn];
int f[maxn];

void init() {
    cnt = 0;
    top = tot = scnt = 0; //栈顶指针为0 ，次序计数器，初始化连通分量标号
    memset(head, -1, sizeof(head));
    memset(dfn, 0, sizeof(dfn)); //结点搜索的次序编号数组为0，同时可以当是否访问的数组使用

    memset(in, 0, sizeof(in));
    memset(out, 0, sizeof(out));
    incnt = outcnt = 0;
}

void addedge(int u, int v) {
    edge[tot].v = v;
    edge[tot].next = head[u];
    head[u] = tot++;
}

void tarjan(int u) { //Tarjan算法求有向图的强连通分量
    dfn[u] = low[u] = ++cnt; //cnt为时间戳
    instack[u] = 1; //标记在栈中
    sstack[top++] = u; //入栈
    for(int e = head[u]; e != -1; e = edge[e].next) { //枚举u的每一条边
        int v = edge[e].v; //u所邻接的边
        if(!dfn[v]) { //未被访问
            tarjan(v); //继续向下找
            if(low[u] > low[v]) low[u] = low[v]; // 更新结点u所能到达的最小次数层
        }
        else if(instack[v] && low[u] > dfn[v]) { //如果v结点在栈内
            low[u] = dfn[v];
        }
    }
    if(low[u] == dfn[u]) { //如果节点u是强连通分量的根
        scnt++; //连通分量标号加1
        while(1) {
            int v = sstack[--top]; //退栈
            instack[v] = 0; //标记不在栈中
            belong[v] = scnt; //出栈结点t属于scnt标号的强连通分量
            if(v == u) break; //直到将u从栈中退出
        }
    }
}

int main()
{
    int T, kcase = 0;
    while(~scanf("%d %d", &n, &m)) {
        init();
        for(int i = 1; i <= n; i++) {
            scanf("%d", &f[i]);
        }
        int a, b;
        while(m--) {
            scanf("%d %d", &a, &b);
            addedge(a, b);
        }
        for(int i = 1; i <= n; i++) { //枚举每个结点，搜索连通分量
            if(!dfn[i]) { //未被访问
                tarjan(i); //则找i结点的连通分量
            }
        }

        for(int i = 1; i <= n; i++) {
            for(int j = head[i]; j != -1; j = edge[j].next) {
                int v = edge[j].v;
                if(belong[v] != belong[i]) {
                    in[belong[v]]++;
                    out[belong[i]]++;
                }
            }
        }
        memset(minn, 0, sizeof(minn));
        int k = 0;
        for(int i = 1; i <= scnt; i++) {
            if(!in[i]) minn[i] = inf, k++;
        }

        for(int i = 1; i <= n; i++) {
            if(minn[belong[i]] > f[i]) {
                minn[belong[i]] = f[i];
            }
        }
        int ans = 0;
        for(int i = 1; i <= scnt; i++) {
            ans += minn[i];
        }
        printf("%d %d\n", k, ans);
    }
    return 0;
}