1142 Maximal Clique（25 分）

1142 Maximal Clique（25 分）

A clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. A maximal clique is a clique that cannot be extended by including one more adjacent vertex. (Quoted from https://en.wikipedia.org/wiki/Clique_(graph_theory))

Now it is your job to judge if a given subset of vertices can form a maximal clique.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers Nv (≤ 200), the number of vertices in the graph, and Ne, the number of undirected edges. Then Ne lines follow, each gives a pair of vertices of an edge. The vertices are numbered from 1 to Nv.

After the graph, there is another positive integer M (≤ 100). Then M lines of query follow, each first gives a positive number K (≤ Nv), then followed by a sequence of K distinct vertices. All the numbers in a line are separated by a space.

Output Specification:

For each of the M queries, print in a line Yes if the given subset of vertices can form a maximal clique; or if it is a clique but not a maximal clique, print Not Maximal; or if it is not a clique at all, print Not a Clique.

Sample Input:

8 10
5 6
7 8
6 4
3 6
4 5
2 3
8 2
2 7
5 3
3 4
6
4 5 4 3 6
3 2 8 7
2 2 3
1 1
3 4 3 6
3 3 2 1

Sample Output:

Yes
Yes
Yes
Yes
Not Maximal
Not a Clique

这题最大的问题就是单词知不知道吐血了

团是无向图的顶点的子集，使得群中的每两个不同的顶点是相邻的。最大团是一个不能再包含一个相邻顶点的团。

A clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. A maximal clique is a clique that cannot be extended by including one more adjacent vertex.

adjacent是相邻的意思   还有clique是团的意思实在无奈

简单的模拟

#include<bits/stdc++.h>
using namespace std;
int graph[205][205]; 
int digit[205];
set<int>st;
int main()
{
	int n,v;
	scanf("%d %d",&n,&v);
	int a,b;
	for(int i = 1;i <= v; i++)
	{
		scanf("%d %d",&a ,&b);
		graph[a][b] = graph[b][a] = 1;
	}
	int m,k;
	scanf("%d",&m);
	for(int i = 1;i <= m;i++)
	{
		scanf("%d",&k);
		st.clear();
		for(int j = 1;j <= k;j++)
		{
			scanf("%d",&digit[j]);	
			st.insert(digit[j]);
		}	
		//遍历会T啊.....
		int flag = 0;
		for(int x = 1; x <= k; x++)
		{
			for(int y = x + 1; y <= k;y++)
			{
				if(graph[ digit[x] ][ digit[y] ] == 0)
				{
					flag = 1;
					break;
				}
			}
		}
		if(flag == 1) printf("Not a Clique\n");
		else
		{
			for(int x = 1; x <= n; x++)
			{
				if(st.count(x))continue;
				else 
				{
					int cnt = 0,j;
					for(j = 1;j <= k;j++)
					{
						if(graph[digit[j]][x]==0)
							break;
					} 
					if(j == k+1)
					{
						printf("Not Maximal\n");
						flag=2;
						break;
					}	
				}
				
			}
			if(!flag)printf("Yes\n");
		}
	}
	return 0;
}