题目链接:点击打开链接
题意:n个点m条路,要设置最少的站点,只需要在每个强连通分量中选一个站点就好,要使费用最少只需要在每个强连通分量中
取权值最小的即可。为了写这道题,看了一下午的tarjan算法,其实还是比较好理解的,自己重新写了两遍这道题都没啥大问题,
这一下午过得觉得很值得。
看了几遍这个博客,感觉写的十分详细,留下链接方便自己以后回来看点击打开链接
#include<vector>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stack>
using namespace std;
const int maxn = 1e5 + 10;
const int MOD = 1e9 + 7;
const int INF = 0x3fffffff;
typedef long long ll;
int a[maxn];
vector<int> G[maxn];
stack<int> st;
bool inst[maxn];
int n, m, index;
ll ans, tot;
int dfn[maxn], low[maxn];
void tarjan(int u)
{
dfn[u] = low[u] = ++index;
st.push(u);
inst[u] = true;
int len = G[u].size();
for(int i = 0; i < len; i++)
{
int v = G[u][i];
if(!dfn[v])
{
tarjan(v);
low[u] = min(low[u], low[v]);
}
else if(inst[v])
low[u] = min(low[u], dfn[v]);
}
if(dfn[u] == low[u])
{
int mi = INF, cnt = 0, v;
do
{
v = st.top();
st.pop();
inst[v] = false;
if(a[v] < mi)
{
mi = a[v];
cnt = 0;
}
if(a[v] == mi)
cnt++;
}while(u != v);
ans += mi;
tot = ((tot % MOD) * (cnt % MOD)) % MOD;
}
}
int main()
{
while(~scanf("%d",&n))
{
memset(inst, false, sizeof(inst));
memset(dfn, 0, sizeof(dfn));
memset(low, 0, sizeof(low));
for(int i = 1; i <= n; i++)
scanf("%d",&a[i]);
scanf("%d",&m);
int u, v;
while(m--)
{
scanf("%d%d",&u,&v);
G[u].push_back(v);
}
ans = index = 0;
tot = 1;
for(int i = 1; i <= n; i++)
{
if(!dfn[i])
tarjan(i);
}
printf("%I64d %I64d\n",ans, tot);
}
return 0;
}