憨憨题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

 ======================================================

Clique：任两点间都有直接相连的边

给定m组序列，判断是不是Clique 或者 Maximal Clique。

Clique怎么判断呢？ 序列的每一顶点，到其余顶点都有边，俩for循环解决。

问题在于：怎么判断是不是最大的Clique？两步：

1.遍历不在序列中的、剩下的顶点。一个FOR循环。

hash。序列中出现过顶点标记为1，遍历所有顶点，如果hash为0则是剩下的顶点。

2.如果剩下的这个顶点，到序列中的每一个顶点都有边(再来一个FOR循环），则说明当前序列不是最大的。

 ======================================================

#include <iostream>
#include <vector>
using namespace std;
int main(){
	int n, e, t1, t2, m, k;
	cin >> n >> e;
	int G[205][205] = { 0 };
	for(int i = 0; i <  e; i++){
		scanf("%d %d", &t1, &t2);
		G[t1][t2] = G[t2][t1] = 1;
	}
	cin >> m;
	for(int i = 0; i < m; i++){
		scanf("%d", &k);
		vector<int> v(k);
		int hash[210] = { 0 }, isCli = 1, isMax = 1;
		for(int j = 0; j < k; j++){
			scanf("%d", &v[j]);
			hash[v[j]] = 1;//已出现的顶点标记一下
		}
		for(int j = 0; j < k; j++){
			for(int h = j + 1; h < k; h++){
				if(G[v[j]][v[h]] == 0){
					isCli = 0;
					printf("Not a Clique\n");
					break;
				}
			}
			if(isCli == 0) break;
		}
		if(isCli == 0) continue;
		for(int j = 1; j <= n; j++){//不在序列中的点（剩下的顶点）
			if(hash[j] == 0){
				for(int h = 0; h < k; h++){
					if(G[j][v[h]] == 0) break;//点j到任一v[h]没有边，则退出
					if(h == k - 1) isMax = 0;//点j到序列任一顶点都有边，说明序列不是最大
				}
			}
			if(isMax == 0){
				printf("Not Maximal\n");
				break;
			}
		}
		if(isMax == 1) printf("Yes\n");
	}
	return 0;
}