hdoj 4324 Triangle LOVE【拓扑排序】

Triangle LOVE

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 4133    Accepted Submission(s): 1630

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<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#define mem(a, b) memset(a, (b), sizeof(a))
#define Wi(a) while(a--)
#define Si(a) scanf("%d", &a)
#define Pi(a) printf("%d\n", (a))
#define INF 0x3f3f3f3f
#include<algorithm>
using namespace std;
const int M = 2020;
char map[M][M];//只有 0和1 直接用字符串数组更方便 
int ind[M];
int main()
{
	int c, t;
	Si(c);
	bool flag;
	for(t = 1; t <= c; t++)
	{
		mem(ind, 0);
		flag = false;
		int n;
		Si(n);
		int i, j, k;
		for(i = 0; i < n; i++)
		{
			scanf("%s", map[i]);
			for(j = 0; j < n; j++)
			{
				if(map[i][j] == '1')
				{
					ind[j]++;
				}
			} 
		}
		for(i = 0; i < n; i++)
		{
			for(j = 0 ; j < n; j++)
			{
				if(!ind[j])  break;
			}
			if(j==n)
			{
				flag = true;break;
			}
			else
			{
				for(k = 0;k < n; k++)
				{
					ind[j] = -1;
					if(map[j][k]=='1' && ind[k])
					{
						ind[k]--;
					}
				}
			}
			
		}
		if(flag)  printf("Case #%d: Yes\n", t);
		else  printf("Case #%d: No\n", t);
	}
	return 0;
}