HDU4324-Triangle LOVE

Triangle LOVE

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

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). A _i,j = 1 means i-th people loves j-th people, otherwise A _i,j = 0.
It is guaranteed that the given relationship is a tournament, that is, A _i,i= 0, A _i,j ≠ A _j,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
  
  

 

Author

BJTU

 

Source

2012 Multi-University Training Contest 3

#include <iostream>
#include <stdio.h>
#include <queue>
#include <string.h>
#include <vector>

using namespace std;

char ch[2005][2005];
int visit[2005];

int main()
{
    int t;
    int n,cas=0;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        memset(visit,0,sizeof visit);
        for(int i=0; i<n; i++)
        {
            scanf("%s",ch[i]);
            {
                for(int j=0; j<n; j++)
                    if(ch[i][j]=='1') visit[j]++;
            }
        }
        queue<int>q;
        for(int i=0; i<n; i++)
        {
            if(!visit[i]) q.push(i);
        }
        int t;
        while(!q.empty())
        {
            t=q.front();
            q.pop();
            for(int i=0; i<n; i++)
            {
                if(ch[t][i]=='1')
                {
                    visit[i]--;
                    if(!visit[i])
                        q.push(i);
                }
            }
        }
        int i;
        for(i=0; i<n; i++)
        {
            if(visit[i]) break;
        }
        if(i>=n) printf("Case #%d: No\n",++cas);
        else printf("Case #%d: Yes\n",++cas);
    }
    return 0;
}