poj--2186--Popular Cows (scc+缩点)
2015-10-23 21:27
375 查看
Popular Cows
Time Limit : 4000/2000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 2 Accepted Submission(s) : 1
[align=left]Problem Description[/align]
Every cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1 <= M <= 50,000) ordered pairs of the form (A, B) that tell you that cow A thinks that cow B is popular.
Since popularity is transitive, if A thinks B is popular and B thinks C is popular, then A will also think that C is
popular, even if this is not explicitly specified by an ordered pair in the input. Your task is to compute the number of cows that are considered popular by every other cow.
[align=left]Input[/align]
* Line 1: Two space-separated integers, N and M
* Lines 2..1+M: Two space-separated numbers A and B, meaning that A thinks B is popular.
[align=left]Output[/align]
* Line 1: A single integer that is the number of cows who are considered popular by every other cow.
[align=left]Sample Input[/align]
3 3
1 2
2 1
2 3
[align=left]Sample Output[/align]
1
/*找出最受欢迎的牛*/ #include<stdio.h> #include<string.h> #include<queue> #include<stack> #include<vector> #include<algorithm> using namespace std; #define MAX 50010 struct node { int u,v; int next; }edge[MAX]; int low[MAX],dfn[MAX]; int sum,sumin,sumout; int sccno[MAX],scc_cnt; int head[MAX],dfs_clock,cnt; bool Instack[MAX]; vector<int>G[MAX]; vector<int>scc[MAX]; stack<int>s; int in[MAX],out[MAX]; int m,n; void init() { memset(head,-1,sizeof(head)); cnt=0; } void add(int u,int v) { edge[cnt].u=u; edge[cnt].v=v; edge[cnt].next=head[u]; head[u]=cnt++; } void getmap() { int a,b; while(m--) { scanf("%d%d",&a,&b); add(a,b); } } void tarjan(int u,int fa) { int v; low[u]=dfn[u]=++dfs_clock; s.push(u); Instack[u]=true; for(int i=head[u];i!=-1;i=edge[i].next) { v=edge[i].v; if(!dfn[v]) { tarjan(v,u); low[u]=min(low[u],low[v]); } else if(Instack[v]) low[u]=min(low[u],dfn[v]); } if(low[u]==dfn[u]) { scc_cnt++; scc[scc_cnt].clear(); for(;;) { v=s.top(); s.pop(); Instack[v]=false; scc[scc_cnt].push_back(v); sccno[v]=scc_cnt; if(u==v) break; } } } void find(int l,int r) { memset(low,0,sizeof(low)); memset(dfn,0,sizeof(dfn)); memset(sccno,0,sizeof(sccno)); memset(Instack,false,sizeof(Instack)); scc_cnt=dfs_clock=0; for(int i=l;i<=r;i++) if(!dfn[i]) tarjan(i,-1); } void suodian() { for(int i=1;i<=scc_cnt;i++) G[i].clear(),in[i]=0,out[i]=0; for(int i=0;i<cnt;i++) { int u=sccno[edge[i].u]; int v=sccno[edge[i].v]; if(v!=u) { G[u].push_back(v); out[u]++,in[v]++; } } } void solve() { int sum=0; int ans=0; for(int i=1;i<=scc_cnt;i++) { if(out[i]==0) //出度为零说明在新图里他是叶子节点,现在统计叶子节点个数 { sum++; ans+=scc[i].size(); } } if(sum>1) printf("0\n"); if(sum==0) printf("%d\n",n); //如果只有1个scc,说明全部的牛都是最受欢迎的 if(sum==1) printf("%d\n",ans); //如果sum==0说明在新图里叶子节点只有一个 //那么当前的scc中所有的牛都是最受欢迎的 } int main() { while(scanf("%d%d",&n,&m)!=EOF) { init(); getmap(); find(1,n); suodian(); solve(); } return 0; }
相关文章推荐
- poj--2186--Popular Cows (scc+缩点)
- Linux下使用Firefox访问dell管理口Idrac
- Leetcode -- Copy List with Random Pointer
- linux内核编译与配置(X86)
- 《学习Opencv》第五章 习题6
- 网站字体渲染过程
- copy-list-with-random-pointer
- Windows8.1下PHP环境配置(PHP5.6、Apache2.4、MySql5.6)
- [线段树双lazy]UVa11992 - Fast Matrix Operations
- linux下各种形式的shell加法操作总结
- 谈谈runloop
- 【xv6学习之HW1】shell
- 运维
- Linux串口工具minicom配置
- 关 于 解 压 缩 的 类 习 题
- shell判断文件夹是否存在
- Hadoop2.6.1中的Reducer实现
- eclipse启动tomcat
- Linux C hello world
- 解决centos KDE命令提示符和文字不紧贴的问题