HDU 5154 Harry and Magical Computer (BFS)

#include<queue>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int n,m;

int maps[105][105];
int book[105];
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        memset(maps,0,sizeof(maps));
        memset(book,0,sizeof(book));
        for(int i=1; i<=m; i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            maps[x][y]=1;
        }
        int ans=1;
        for(int k=1; k<=n; k++)<span style="white-space:pre">				</span>//瞎搞搞
        {
            queue<int>Q;
            Q.push(k);          //环的起点可能不是1
            book[k]=1;
            int temp=1;
            while(!Q.empty())
            {
                int a=Q.front();
                Q.pop();
                if(a==k&&temp!=1)
                {
                    printf("NO\n");
                    ans=0;
                    goto key;
                }
                for(int i=1; i<=n; i++)
                {
                    if((book[i]==0||maps[a][k]==1)&&maps[a][i]==1)
                    {
                        //printf("   %d %d\n",a,i);
                        book[i]=1;
                        Q.push(i);
                    }
                }
                temp++;
            }
        }
        key:    int a;
        if(ans==1)  printf("YES\n");
    }
}   

Harry and Magical Computer

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

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

  
  

   
   3 2
3 1
2 1
3 3
3 2
2 1
1 3
  
  

 

Sample Output

  
  

   
   YES
NO
  
  

 

Source

BestCoder Round #25

 

Recommend

heyang   |   We have carefully selected several similar problems for you:   5970  5969  5968  5967  5966