Checkposts强连通分量

Your city has n junctions. There are m one-way roads between the junctions. As a mayor of the city, you have to ensure the security of all the junctions.

To ensure the security, you have to build some police checkposts. Checkposts can only be built in a junction. A checkpost at junction i can protect junction j if either i = j or the police patrol car can go to j from i and then come back to i.

Building checkposts costs some money. As some areas of the city are more expensive than others, building checkpost at some junctions might cost more money than other junctions.

You have to determine the minimum possible money needed to ensure the security of all the junctions. Also you have to find the number of ways to ensure the security in minimum price and in addition in minimum number of checkposts. Two ways are different if any of the junctions contains a checkpost in one of them and do not contain in the other.

Input
In the first line, you will be given an integer n, number of junctions (1 ≤ n ≤ 105). In the next line, n space-separated integers will be given. The ith integer is the cost of building checkpost at the ith junction (costs will be non-negative and will not exceed 109).

The next line will contain an integer m (0 ≤ m ≤ 3·105). And each of the next m lines contains two integers ui and vi (1 ≤ ui, vi ≤ n; u ≠ v). A pair ui, vi means, that there is a one-way road which goes from ui to vi. There will not be more than one road between two nodes in the same direction.

Output
Print two integers separated by spaces. The first one is the minimum possible money needed to ensure the security of all the junctions. And the second one is the number of ways you can ensure the security modulo 1000000007 (109 + 7).
Input
3
1 2 3
3
1 2
2 3
3 2
Output
3 1
Input
5
2 8 0 6 0
6
1 4
1 3
2 4
3 4
4 5
5 1
Output
8 2
Input
10
1 3 2 2 1 3 1 4 10 10
12
1 2
2 3
3 1
3 4
4 5
5 6
5 7
6 4
7 3
8 9
9 10
10 9
Output
15 6
Input
2
7 91
2
1 2
2 1
Output
7 1
题意：

给你n个点，m条有向边，现在有你建立一些警察局。
每个点有一个建警察局的代价。
每个警察局能够保卫该点当且仅当警察局能到该点且能返回警察局。
现在问你建若干个警察局的最小代价和方案数是多少。
先把n个点做一个强连通。对于每个强连通分量，其中的点肯定能够互相到达。

强连通分量模板

#include<vector>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stack>
using namespace std;
const int maxn = 1e5 + 10,MOD  = 1e9 + 7,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;
	}
}
void solve() {
	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("%lld %lld\n",ans, tot);
	}}
int main()
{
	solve();
	return 0;
}

图论