POJ 3180 The Cow Prom 强连通分量
来源:互联网 发布:windows之家一键重装 编辑:程序博客网 时间:2024/06/04 17:59
The Cow Prom
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1691 Accepted: 1055
Description
The N (2 <= N <= 10,000) cows are so excited: it's prom night! They are dressed in their finest gowns, complete with corsages and new shoes. They know that tonight they will each try to perform the Round Dance.
Only cows can perform the Round Dance which requires a set of ropes and a circular stock tank. To begin, the cows line up around a circular stock tank and number themselves in clockwise order consecutively from 1..N. Each cow faces the tank so she can see the other dancers.
They then acquire a total of M (2 <= M <= 50,000) ropes all of which are distributed to the cows who hold them in their hooves. Each cow hopes to be given one or more ropes to hold in both her left and right hooves; some cows might be disappointed.
For the Round Dance to succeed for any given cow (say, Bessie), the ropes that she holds must be configured just right. To know if Bessie's dance is successful, one must examine the set of cows holding the other ends of her ropes (if she has any), along with the cows holding the other ends of any ropes they hold, etc. When Bessie dances clockwise around the tank, she must instantly pull all the other cows in her group around clockwise, too. Likewise,
if she dances the other way, she must instantly pull the entire group counterclockwise (anti-clockwise in British English).
Of course, if the ropes are not properly distributed then a set of cows might not form a proper dance group and thus can not succeed at the Round Dance. One way this happens is when only one rope connects two cows. One cow could pull the other in one direction, but could not pull the other direction (since pushing ropes is well-known to be fruitless). Note that the cows must Dance in lock-step: a dangling cow (perhaps with just one rope) that is eventually pulled along disqualifies a group from properly performing the Round Dance since she is not immediately pulled into lockstep with the rest.
Given the ropes and their distribution to cows, how many groups of cows can properly perform the Round Dance? Note that a set of ropes and cows might wrap many times around the stock tank.
Only cows can perform the Round Dance which requires a set of ropes and a circular stock tank. To begin, the cows line up around a circular stock tank and number themselves in clockwise order consecutively from 1..N. Each cow faces the tank so she can see the other dancers.
They then acquire a total of M (2 <= M <= 50,000) ropes all of which are distributed to the cows who hold them in their hooves. Each cow hopes to be given one or more ropes to hold in both her left and right hooves; some cows might be disappointed.
For the Round Dance to succeed for any given cow (say, Bessie), the ropes that she holds must be configured just right. To know if Bessie's dance is successful, one must examine the set of cows holding the other ends of her ropes (if she has any), along with the cows holding the other ends of any ropes they hold, etc. When Bessie dances clockwise around the tank, she must instantly pull all the other cows in her group around clockwise, too. Likewise,
if she dances the other way, she must instantly pull the entire group counterclockwise (anti-clockwise in British English).
Of course, if the ropes are not properly distributed then a set of cows might not form a proper dance group and thus can not succeed at the Round Dance. One way this happens is when only one rope connects two cows. One cow could pull the other in one direction, but could not pull the other direction (since pushing ropes is well-known to be fruitless). Note that the cows must Dance in lock-step: a dangling cow (perhaps with just one rope) that is eventually pulled along disqualifies a group from properly performing the Round Dance since she is not immediately pulled into lockstep with the rest.
Given the ropes and their distribution to cows, how many groups of cows can properly perform the Round Dance? Note that a set of ropes and cows might wrap many times around the stock tank.
Input
Line 1: Two space-separated integers: N and M
Lines 2..M+1: Each line contains two space-separated integers A and B that describe a rope from cow A to cow B in the clockwise direction.
Lines 2..M+1: Each line contains two space-separated integers A and B that describe a rope from cow A to cow B in the clockwise direction.
Output
Line 1: A single line with a single integer that is the number of groups successfully dancing the Round Dance.
Sample Input
5 42 43 51 24 1
Sample Output
1
#include<stdio.h>#include<algorithm>#include<string.h>#include<stack>#include<vector>using namespace std;const int maxm=10050;int id=1,sum=1,low[maxm],dfn[maxm],b[maxm],num[maxm],vis[maxm],ans;vector<int>v[maxm];stack<int>s;void tarjian(int x);int main(){int n,i,j,k,m,x,y;scanf("%d%d",&n,&m);memset(low,0,sizeof(low));memset(dfn,0,sizeof(dfn));memset(num,0,sizeof(num));memset(vis,0,sizeof(vis));for(i=1;i<=m;i++){scanf("%d%d",&x,&y);v[x].push_back(y);}sum=1;ans=0;for(i=1;i<=n;i++){if(!dfn[i])tarjian(i);}printf("%d\n",ans);return 0;}void tarjian(int x){int i,j;vis[x]=1;low[x]=dfn[x]=id++;s.push(x);for(i=0;i<v[x].size();i++){int xx=v[x][i];if(!dfn[xx]){tarjian(xx);low[x]=min(low[x],low[xx]);//printf("%d\n",low[x]);}else if(vis[xx])low[x]=min(low[x],dfn[xx]);}if(low[x]==dfn[x]){while(s.size()){int xx=s.top();s.pop();num[sum]++;b[xx]=sum;vis[xx]=0;if(xx==x)break;}if(num[sum]>1)ans+=1;sum+=1;}}
0 0
- poj 3180 The Cow Prom(强连通分量 Tarjan)
- poj 3180 The Cow Prom 强连通分量
- poj 3180 The Cow Prom 强连通分量
- POJ 3180 The Cow Prom【强连通分量分解】
- poj 3180 The Cow Prom 强连通分量tarjan
- POJ 3180 The Cow Prom 强连通分量
- POJ 3180 The Cow Prom 求强连通分量 .
- POJ 3180 The Cow Prom 强连通分量
- Poj 3180 The Cow Prom(强连通分量)
- 强连通分量 POJ 3180 The Cow Prom题解
- 【POJ】3180 The Cow Prom 强连通
- Poj 3180 The Cow Prom【求强连通分量中元素个数大于1的个数】
- [POJ 3180] The Cow Prom Tarjan求强连通分量 模板题
- POJ 3180 The Cow Prom(强连通)
- POJ 3180 The Cow Prom(Tarjan Algorithm求强连通子集)
- poj3180 The Cow Prom(强连通)
- |BZOJ 1654|强连通分量|[Usaco2006 Jan]The Cow Prom 奶牛舞会
- POJ--2180[The Cow Prom] 求结点>=2的的强连通分支个数
- spring mvc框架下 后台往前台传送json数据
- 深度学习UFLDL教程翻译之自动编码器
- 算法与数据结构大纲(设计与实现)
- 大数据最核心的价值是什么?
- 无线数据透传介绍及应用,加快智能设备新产品开发速度,快速实现传统设备升级改造
- POJ 3180 The Cow Prom 强连通分量
- jquery 选择器 .first()和:first
- Leetcode 之 Unique Paths
- 使用git从本地上传至git码云远程仓库
- android studio配置lambda教程
- Java反射机制
- RabbitMQ基础学习笔记(C#代码示例)
- POJ - 2411 Mondriaan's Dream(状态压缩DP)
- Java Web基础——Action+Service +Dao三层的功能划分