1142 Maximal Clique

1142 Maximal 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. (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

分析：现有一图，图中所有顶点的集合的子集s;若s中任意两个不同的顶点都存在直接相连的边，则称s为Clique;如果剩余顶点中不存在和s中任意一个顶点都直接相连的点，则称s为maxiaml Clique。现在给出n个指定子集，判断是否为
Maximal Clique.
参考代码：

#include<iostream>
#include<vector>
#define N 250
using namespace std;
int graph[N][N];
int main()
{
	int n, m, k, t, v1, v2;
	scanf_s("%d%d", &n, &m);
	for (int i = 1; i <= m; i++) {
		scanf_s("%d%d", &v1, &v2);
		graph[v1][v2] = graph[v2][v1] = 1;
	}
	scanf_s("%d", &k);
	for (int i = 1; i <= k; i++) {
		int isClique = 1, isMaxClique = 0;
		scanf_s("%d", &t);
		vector<int>v(t), hash(n + 2, 0);
		for (int j = 0; j < t; j++) {
			scanf_s("%d", &v[j]);
			hash[v[j]] = 1;
		}
		for (int j = 0; j < t - 1; j++) {
			for (int p = j + 1; p < t; p++) {
				if (graph[v[j]][v[p]] == 0) {
					isClique = 0;
					printf("Not a Clique\n");
					break;
				}
			}
			if (isClique == 0)break;
		}
		if (isClique) {
			for (int j = 1; j <= n; j++) {
				isMaxClique = 0;
				if (hash[j] != 1) {    
					isMaxClique = 1;     //若存在满足条件的点，则isMaxClique值为1.
					for (int p = 0; p < t; p++) {
						if (graph[j][v[p]] == 0)isMaxClique = 0;
					}
				}
				if (isMaxClique == 1)break;
			}
			if (isMaxClique == 1)	printf("Not Maximal\n");
			else printf("Yes\n");
		}
	}

	return 0;
}