前段时间有学过并查集的小伙伴们应该都知道怎么用并查集判断是否成环了吧,今天在实验室训练的时候又学会了一项新技能——拓扑,放个题和代码吧。
D - Legal or Not
ACM-DIY is a large QQ group where many excellent acmers get together. It is so harmonious that just like a big family. Every day,many "holy cows" like HH, hh, AC, ZT, lcc, BF, Qinz and so on chat on-line to exchange their ideas. When someone has questions, many warm-hearted cows like Lost will come to help. Then the one being helped will call Lost "master", and Lost will have a nice "prentice". By and by, there are many pairs of "master and prentice". But then problem occurs: there are too many masters and too many prentices, how can we know whether it is legal or not?
We all know a master can have many prentices and a prentice may have a lot of masters too, it's legal. Nevertheless,some cows are not so honest, they hold illegal relationship. Take HH and 3xian for instant, HH is 3xian's master and, at the same time, 3xian is HH's master,which is quite illegal! To avoid this,please help us to judge whether their relationship is legal or not.
Please note that the "master and prentice" relation is transitive. It means that if A is B's master ans B is C's master, then A is C's master.Input
The input consists of several test cases. For each case, the first line contains two integers, N (members to be tested) and M (relationships to be tested)(2 <= N, M <= 100). Then M lines follow, each contains a pair of (x, y) which means x is y's master and y is x's prentice. The input is terminated by N = 0.
TO MAKE IT SIMPLE, we give every one a number (0, 1, 2,..., N-1). We use their numbers instead of their names.Output
For each test case, print in one line the judgement of the messy relationship.
If it is legal, output "YES", otherwise "NO".
#include<iostream>
#include<string.h>
using namespace std;
int map1[1010][1010],book[1010],f[1010];///在这用map1来存图,book记录当前节点是否使用过,f记录入度
int n,m,s1;
void tuopu()
{
int sum=0,i,j;
while(sum<n)
{
s1=0;
for (i=0;i<n;i++)
{
if (book[i]==0&&f[i]==0)///判断当前节点是否用过并且当前节点入度是否为0
{
book[i]=1;
s1=1;
break;
}
}
sum++;
if (s1==0)///如果s1为0,则没有入度为0的节点,证明有环存在
{
printf("NO\n");
return ;
}
for (j=0;j<n;j++)///将与入度为0的节点,和与之相连的边都删除,并将其后继的入度减一
{
if (map1[i][j]==1)
{
map1[i][j]=0;
f[j]--;
}
}
}
}
int main()
{
while(~scanf("%d%d",&n,&m)&&n!=0||m!=0)
{
int a,b,i,j;
memset(book,0,sizeof(book));
memset(map1,0,sizeof(map1));
memset(f,0,sizeof(f));
for (i=1;i<=m;i++)
{
scanf("%d%d",&a,&b);
if(map1[a][b]==0)///避免重边导致入度多加
{
map1[a][b]=1;
f[b]++;
}
}
tuopu();
if (s1==1)
{
printf("YES\n");
}
}
return 0;
}