bzoj1654[The Cow Prom 奶牛舞会] tarjan求有向无环图的强联通分量

1654: [Usaco2006 Jan]The Cow Prom 奶牛舞会

Time Limit: 5 Sec Memory Limit: 64 MB
Submit: 350 Solved: 265
[Submit][Status][Discuss]
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.

约翰的N(2≤N≤10000)只奶牛非常兴奋，因为这是舞会之夜！她们穿上礼服和新鞋子，别上鲜花，她们要表演圆舞．



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.

第1行输入N和M，接下来M行每行两个整数A和B，表示A牵引着B.
Output

• Line 1: A single line with a single integer that is the number of groups successfully dancing the Round Dance.

成功跳圆舞的奶牛组合数．
Sample Input

5 4

2 4

3 5

1 2

4 1

INPUT DETAILS:

ASCII art for Round Dancing is challenging. Nevertheless, here is a

representation of the cows around the stock tank:

   _1___

/**** \


5 /** 2

/ /TANK|

\ ********/

\ ******/ 3

\ 4____/  /

\_______/


Sample Output

1

HINT

1，2，4这三只奶牛同属一个成功跳了圆舞的组合．而3，5两只奶牛没有跳成功的圆舞

solution

tarjan

/**************************************************************
Problem: 1654
User: Venishel
Language: C++
Result: Accepted
Time:60 ms
Memory:5828 kb
****************************************************************/

#include <cstdio>
#include <iostream>
#include <cstring>
#include <stack>
using namespace std;
#define N 100000
#define M N<<2
int nxt[M], to[M], head[N];
int DFN[N], LOW[N];
stack<int> sta;
bool vis[N];
int cnt, tot;
int ans = 0;
void addeage( int u, int v ){
nxt[++cnt] = head[u];
to[cnt] = v;
head[u] = cnt;
return;
}

void tarjan( int x ){
DFN[x] = LOW[x] = ++tot;
sta.push(x);
vis[x] = true;
for ( int i = head[x]; i; i = nxt[i]){
int v = to[i];
if ( !DFN[v] ){
tarjan(v);
LOW[x] = min( LOW[x], LOW[v]);
}
else if ( vis[v] ){
LOW[x] = min( LOW[x], DFN[v]);
}
}
if ( LOW[x] == DFN[x] ) {
int t;
int tos = 0;
do{
t = sta.top();
tos++;
//printf( "%d ", t );
vis[t] = false;
sta.pop();
}while ( x != t );
//printf( "\n");
ans += (tos > 1);
}
return ;
}

int main(){
cnt = 1, tot = 0;
memset( head, 0, sizeof( head) );
int n, m;
scanf( "%d%d", &n, &m );
int x, y;
for ( int i = 1; i <= m; i++){
scanf( "%d%d", &x, &y );
addeage( x, y);
}
for ( int i = 1; i <= n; i++)
if ( !DFN[i] ) tarjan( i );
printf( "%d", ans);
return 0;
}
09-14 35

12-18 94
06-15 1万+
©️2020 CSDN 皮肤主题: 编程工作室 设计师:CSDN官方博客