HDOJ 4324 Triangle LOVE (拓扑排序)

Triangle LOVE

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/65536K (Java/Other)

Total Submission(s) : 5   Accepted Submission(s) : 3

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

#include<iostream>
#include<queue>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#define MAX 2005
using namespace std;
int in[MAX];
vector<int>G[MAX];
int TopSort(int n)
{
    queue<int>p;
    int i, t, Count = 0;
    for (i = 1; i <= n; i++)
        if (in[i] == 0)
            p.push(i);
    while (!p.empty())
    {
        t = p.front(); p.pop();
        Count++;
        for (i = 0; i < G[t].size(); i++)
        {
            in[G[t][i]]--;
            if (in[G[t][i]] == 0)
                p.push(G[t][i]);
        }
    }
    if (Count <n)
        return 1;
    else return 0;

}
int main()
{
    int n, t, i, j, cc = 0;
    cin.sync_with_stdio(false);
    string s;
    cin >> t;
    while (t--)
    {    
        cc++;
        cin >> n;
        memset(in, 0, sizeof(in));
        for (int i = 0; i <= n; i++) G[i].clear();
        for (i = 1; i <= n; i++)
        {
            cin >> s;
            for (j = 0; j < s.size(); j++)
            {
                if (s[j] == '1')
                {
                    G[i].push_back(j + 1);
                    in[j+1]++;

                }
            }
        }
        if (TopSort(n))
            printf("Case #%d: Yes\n", cc);
        else printf("Case #%d: No\n", cc);
    }
    return 0;
}