hdu 4324 Triangle LOVE (拓扑排序)

Triangle LOVE

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 5472    Accepted Submission(s): 2110

 

Problem Description

Recently, scientists find that there is love between any of two people. For example, between A and B, if A don’t love B, then B must love A, vice versa. And there is no possibility that two people love each other, what a crazy world!
Now, scientists want to know whether or not there is a “Triangle Love” among N people. “Triangle Love” means that among any three people (A,B and C) , A loves B, B loves C and C loves A.
  Your problem is writing a program to read the relationship among N people firstly, and return whether or not there is a “Triangle Love”.

 

 

Input

The first line contains a single integer t (1 <= t <= 15), the number of test cases.
For each case, the first line contains one integer N (0 < N <= 2000).
In the next N lines contain the adjacency matrix A of the relationship (without spaces). Ai,j = 1 means i-th people loves j-th people, otherwise Ai,j = 0.
It is guaranteed that the given relationship is a tournament, that is, Ai,i= 0, Ai,j ≠ Aj,i(1<=i, j<=n,i≠j).

 

 

Output

For each case, output the case number as shown and then print “Yes”, if there is a “Triangle Love” among these N people, otherwise print “No”.
Take the sample output for more details.

 

 

Sample Input

2 5 00100 10000 01001 11101 11000 5 01111 00000 01000 01100 01110

 

 

Sample Output

Case #1: Yes Case #2: No

思路：这题主要判断是否成环，然后用模板即可.

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithM>
#include <cmath>
#include <queue>
#include <list>
using namespace std;
int n;
char map[2005][2005];
int rudu[2005];
int k;
int tp()
{
    int i,j,l;
    for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
        {
            if(rudu[j]==0)
            {
                rudu[j]--;
                for(l=0;l<n;l++)
                {
                    if(map[j][l]=='1')
                        rudu[l]--;
                }
                break;
            }
            if(j==n-1)return 0;
        }
    }
    return 1;
}
int main()
{
    int t;
    cin>>t;
    int z=1;
    while(t--)
    {
        cin>>n;
        int i,j;
        memset(rudu,0,sizeof(rudu));
        for(i=0;i<n;i++)
        {
            scanf("%s",map[i]);
            for(j=0;j<n;j++)
            {
                if(map[i][j]=='1')
                    rudu[j]++;
            }
        }
        printf("Case #%d: ",z++);
        if(!tp())cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
    return 0;
}