Checkposts (codeforces #244dv2) 强连通分量 tarjan算法
来源:互联网 发布:舆情监测软件下载 编辑:程序博客网 时间:2024/05/17 03:51
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).
Sample test(s)
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
/***********************************************\ |Author: YMC |Created Time: 2014/5/10 22:36:04 |File Name: tarjan.cpp |Description: \***********************************************/#include <iostream>#include <cstdio>#include <cmath>#include <cstdlib>#include <string>#include <cstring>#include <algorithm>#include <vector>#include <list>#include <map>#include <set>#include <deque>#include <queue>#include <stack>using namespace std;#define maxn 100005int n;int stop;int cnt;int visitnum;int dfn[maxn];int low[maxn];bool instack[maxn];int stap[maxn];int belong[maxn];#define mod 1000000007vector<int>tree[maxn];void tarjan(int i){ int j; dfn[i] = low[i] = ++visitnum; instack[i] = true; stap[++stop] = i; for(int k=0;k<tree[i].size();k++){ j = tree[i][k]; if(!dfn[j]){ tarjan(j); if(low[j]<low[i]) low[i] = low[j]; } else if(instack[j] && dfn[j]<low[i]) low[i] = dfn[j]; } if(dfn[i] == low[i]){ cnt++; do{ j = stap[stop--]; instack[j] = false; belong[j] = cnt; } while(j!=i); }}void solve(){ stop = cnt = visitnum = 0; memset(dfn,0,sizeof(dfn)); for(int i=1;i<=n;++i){ if(!dfn[i]) tarjan(i); }}long long val[maxn];long long ma[maxn];long long mb[maxn];#define inf 0x7fffffffint main() { //freopen("input.txt","r",stdin); scanf("%d",&n); for(int i=1;i<=n;++i) scanf("%lld",&val[i]); int m; scanf("%d",&m); int a,b; while(m--){ scanf("%d%d",&a,&b); tree[a].push_back(b); } solve(); for(int i=1;i<=n;++i){ ma[i] = inf; } for(int i=1;i<=n;++i){ if(val[i] < ma[belong[i]]){ ma[belong[i]] = val[i]; mb[belong[i]] = 1; } else if(val[i] == ma[belong[i]]){ mb[belong[i]] ++; } } long long sum = 0; long long nn = 1; for(int i=1;i<=cnt;++i){ sum += ma[i]; nn *= mb[i]; nn%=mod; } printf("%lld %lld\n",sum,nn); return 0;}
- Checkposts (codeforces #244dv2) 强连通分量 tarjan算法
- codeforces#244_div2_C Checkposts 强连通分量,Tarjan
- Codeforces 427C Checkposts (强连通分量 tarjan模板)
- Codeforces 427C Checkposts 强连通分量(tarjan)
- Codeforces Round #244 (Div. 2) 427C Checkposts (强连通分量 tarjan模板)
- cf 244c Checkposts 强连通分量
- Codeforces 427C - Checkposts 极大连通分量Tarjan算法模板题(STL实现)
- 强连通分量 Tarjan算法
- 强连通分量 tarjan算法
- 强连通分量Tarjan算法
- Tarjan强连通分量算法
- 强连通分量Tarjan算法
- 强连通分量Tarjan算法
- 强连通分量 Tarjan算法
- 强连通分量-tarjan算法
- Codeforces 427C Checkposts【Tarjan强连通+缩点染色】
- CF:Problem 427C - Checkposts强连通Tarjan算法
- CF:Problem 427C - Checkposts强连通 Tarjan算法
- 强连通分量两种算法。tarjan和kosaraju
- poj 2449 Remmarguts’ Date第k短路 dij+A*
- Java工具类之Apache的Commons Lang和BeanUtils
- ThinkPHP 框架学习
- poj 3013 spfa 最短路 Big Christmas Tree
- Checkposts (codeforces #244dv2) 强连通分量 tarjan算法
- 数据段、代码段、堆栈段、BSS段的区别
- ORACLE 10G修改字符编码,不再有限制
- poj1199和zoj1506 Left labyrinths(搜索,两个oj都过了)
- Notepad++正则表达式使用
- long long 与 __int64
- 2014/08/2 暑期个人赛二(每周)
- 代码创建布局
- 传智播客第二次测试总结