对于有向图的强连通分量tarjan算法解析请看这篇文章
本题属于强连通分量的缩点的偏模板题,可以将情况分为两种,一是含有无法贿赂无法揭发的罪犯即输出NO+罪犯编号
二是 1、罪犯揭发链不成环,那么需要入度为0的罪犯的钱,2、如果成环那么就需要环中最小的钱,对于2我们经过环的缩点可以转化为1,所以就是找缩点后入度为0的点答案想加便可!!详细请看代码及注释
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAX_N = 100000;
#define N 100000
#define M 100000
#define inf 0x3f3f3f3f
int tot = 0;
int head[MAX_N], nxt[MAX_N*2], ver[MAX_N *2], wei[MAX_N *2];
void addedge(int u, int v)
{
nxt[++tot] = head[u], head[u] = tot, ver[tot] = v;
}
int instack[N];//是否在stack
int stack[N];
int Belong[N];//各顶点属于哪个强连通分量
int DFN[N];//时间戳
int LOW[N];//u或u的子树能够追溯到的最早的栈中节点的序号(时间戳)
int n, m;//n:点的个数;m:边的条数
int cnt_edge;//边的计数器
int Index;//时间戳
int top;
int Bcnt;//有多少个强连通分量
int mny[MAX_N];//记录每个可贿赂的点的钱
int sdmny[MAX_N];//缩点时记录环中最少的钱
int rd[MAX_N];//记录缩点后每个点的入度,方便找入度为0的点
void tarjan(int u)//tartjan缩点
{
int i, j;
int v;
DFN[u] = LOW[u] = ++Index;
instack[u] = true;
stack[++top] = u;
for (i = head[u]; i != -1; i = nxt[i])
{
v = ver[i];
if (!DFN[v])//如果点v没被访问
{
tarjan(v);
if (LOW[v] < LOW[u])
LOW[u] = LOW[v];
}
else//如果点v已经被访问过
if (instack[v] && DFN[v] < LOW[u])
LOW[u] = DFN[v];
}
if (DFN[u] == LOW[u])
{
Bcnt++;
do
{
j = stack[top--];
instack[j] = false;
Belong[j] = Bcnt;
sdmny[Bcnt] = min(sdmny[Bcnt], mny[j]);//缩点时记录最小钱
} while (j != u);
}
}
void solve()
{
int i;
top = Bcnt = Index = 0;
memset(DFN, 0, sizeof(DFN));
memset(LOW, 0, sizeof(LOW));
for (i = 1; i <= n; i++)
if (!DFN[i] && mny[i] != inf)
{
tarjan(i);
}
}
int main()
{
memset(mny, inf, sizeof(mny));
memset(sdmny, inf, sizeof(sdmny));
memset(head, -1, sizeof(head));
int p;
scanf("%d", &n);
scanf("%d", &p);
for (int i = 1; i <= p; i++)
{
int t1, t2;
scanf("%d %d", &t1, &t2);
mny[t1] = t2;
}
scanf("%d", &m);
for (int i = 1; i <= m; i++)
{
int t1, t2;
scanf("%d %d", &t1, &t2);
addedge(t1, t2);
}
solve();
for (int i = 1; i <= n; i++)
{
if (!DFN[i])
{
printf("NO\n");
printf("%d\n", i);
return 0;
}
}
for (int i = 1;i <= n; i++)
{
for (int j = head[i]; j != -1; j = nxt[j])
{
if (Belong[i] != Belong[ver[j]])
{
rd[Belong[ver[j]]]++;
}
}
}
printf("YES\n");
int ans = 0;
for (int i = 1; i <= Bcnt; i++)
{
if (!rd[i])
{
ans += sdmny[i];
}
}
printf("%d\n", ans);
}