强连通分量 + 缩点

题目链接
题目大意：
都是中文就不讲了
思路：
从每个点开始找环进行缩点，记录出每个环中的价值最小值 以及id，缩点之后重新建图，求出入读为零的点开始dfs，若某个点的入读为零并且价值为INF，则不可以收买并且其他小偷也没有证据指控这个贼
代码：

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 5;
const int INF = 0x3f3f3f3f3f3f;
struct node{
    int from, to, next;
}edge[MAXN << 1];
int head[MAXN];
int cnt = 0;
void add(int from ,int to){
    edge[cnt].from = from;
    edge[cnt].to = to;
    edge[cnt].next = head[from];
    head[from] = cnt ++;
}
int scc[MAXN], dfn[MAXN], low[MAXN], id[MAXN], vis[MAXN],mon[MAXN],flag[MAXN],rd[MAXN];
stack<int > s;
int scnt = 0;
int sum = 0;
int index1 = 0;
void tarjan(int root){
    dfn[root] = low[root] = ++index1;
    s.push(root);
    for(int i = head[root]; ~i; i = edge[i].next){
        int v = edge[i].to;
        if(!dfn[v]){
            tarjan(v);
            low[root] = min(low[root], low[v]);
        }
        else if(!scc[v]){
            low[root] = min(low[root], dfn[v]);
        }
    }
    if(low[root] == dfn[root]){
        scnt ++;
        while(!s.empty()){
            int x = s.top();
            s.pop();
            if(!id[scnt]) id[scnt] = x;//记录id 因为要重新建图不用最小也行
            else id[scnt] = min(id[scnt],x);
            scc[x] = scnt;
            vis[scnt] = min(vis[scnt], mon[x]);//找到这个环上可以收买的最小的钱然后收买
            if(x == root) break;
        }
    }
}
void dfs(int x){
    if(flag[x]) return ;//被遍历过就跳出
    for(int i = head[x]; ~i; i = edge[i].next){
        flag[edge[i].to] = 1;
        dfs(edge[i].to);
    }
}
int main()
{
    memset(head, -1 ,sizeof(head));//初始化
    memset(mon, INF, sizeof(mon));
    memset(vis, INF, sizeof(vis));
    int n;
    cin >> n;
    int k;
    cin >> k;
    for(int i = 0; i < k ;i ++){
        int x;
        int y;
        cin >> x >>y;
        if(!mon[x]) mon[x] = y;
        else mon[x] = min(mon[x], y);
    }
    cin >> k;
    for(int i = 0; i < k; i ++){
        int x,y;
        cin >> x >> y;
        add(x, y);
    }
    for(int i = 1; i <= n ;i ++){
        if(!dfn[i]) tarjan(i);//每个点进行找环
    }

    memset(head, -1, sizeof(head));//重新建图要记得初始化
    int x = cnt;
    cnt = 0;
    for(int i = 0; i < x;i ++){
        if(scc[edge[i].from] != scc[edge[i].to]){
            rd[scc[edge[i].to]] ++;//这里要先记录入读不然会错
            add(scc[edge[i].from],scc[edge[i].to]);


        }
    }
    for(int i = 1; i <= scnt; i ++){
        if(!rd[i]){//入读为0的点必须收买 
            if(vis[i] == INF){//不能被收买输出NO
                printf("NO\n");
                cout << id[i] <<endl;
                return 0;
            }
            dfs(i);
            sum += vis[i];
        }
    }
    cout <<"YES" <<endl;
    cout <<sum << endl;
}