HDU 5154 Harry and Magical Computer （拓扑排序）

最新推荐文章于 2020-09-05 09:49:16 发布

David_Jett

最新推荐文章于 2020-09-05 09:49:16 发布

阅读量619

点赞数

分类专栏：编程题——图论文章标签：入门拓扑排序

本文链接：https://blog.csdn.net/David_Jett/article/details/52072699

版权

编程题——图论专栏收录该内容

29 篇文章 0 订阅

订阅专栏

题目链接：HDU 5154

题面：

Harry and Magical Computer

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2183 Accepted Submission(s): 862

Problem Description

In reward of being yearly outstanding magic student, Harry gets a magical computer. When the computer begins to deal with a process, it will work until the ending of the processes. One day the computer got n processes to deal with. We number the processes from 1 to n. However there are some dependencies between some processes. When there exists a dependencies (a, b), it means process b must be finished before process a. By knowing all the m dependencies, Harry wants to know if the computer can finish all the n processes.

Input

There are several test cases, you should process to the end of file.
For each test case, there are two numbers n m on the first line, indicates the number processes and the number of dependencies.

1≤n≤100,1≤m≤10000
The next following m lines, each line contains two numbers a b, indicates a dependencies (a, b).

1≤a,b≤n

Output

Output one line for each test case.
If the computer can finish all the process print "YES" (Without quotes).
Else print "NO" (Without quotes).

Sample Input

Sample Output

  
  
   
   YES
NO

题意：

任务之间有依赖关系，如a->b，那么必须先完成任务b，才能完成任务a，问是否能够完成全部任务。

解题：

经典的拓扑排序，找入度为0的点，不断入队列，广搜即可，最后看是否所有点都被访问了。

代码：

#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#define inf 1000000
using namespace std;
struct edge
{
    int fm,to,nxt;
}store[10010];
int in[105],vis[105],head[105],n,cnt;
void addedge(int a,int b)
{
    store[cnt].nxt=head[a];
    head[a]=cnt;
    store[cnt].fm=a;
    store[cnt++].to=b;
}
queue <int> q;
void bfs()
{
   int cur;
   for(int i=1;i<=n;i++)
       if(in[i]==0)
           q.push(i);
   while(!q.empty())
   {
       cur=q.front();
       q.pop();
       vis[cur]=1;
       for(int i=head[cur];~i;i=store[i].nxt)
       {
           int v=store[i].to;
           in[v]--;
           if(in[v]==0)
               q.push(v);
       }
   }
}
int main()
{
    int m,a,b;
    while(~scanf("%d%d",&n,&m))
    {
        cnt=0;
        memset(head,-1,sizeof(head));
        memset(in,0,sizeof(in));
        memset(vis,0,sizeof(vis));
        for(int i=0;i<m;i++)
        {
            scanf("%d%d",&a,&b);
            addedge(b,a);
            in[a]++;
        }
        bfs();
        bool flag=1;
        for(int i=1;i<=n;i++)
        {
            if(vis[i]==0)
            {
                flag=0;
                break;
            }
        }
        if(flag)
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}