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

---

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
#include<queue>
using namespace std;
int graph[210][210];
int nv, ne, k;
int main() {
	cin >> nv >> ne;
	for (int i = 1; i <= nv; i++) {
		graph[i][i] = 1;
	}
	for (int i = 0; i < ne; i++) {
		int t1, t2;
		scanf("%d%d", &t1, &t2);
		graph[t1][t2] = graph[t2][t1] = 1;
	}
	cin >> k;
	for (int i = 0; i < k; i++) {
		int n;
		scanf("%d", &n);
		vector<int> v;
		set<int> s;
		for (int j = 0; j < n; j++) {
			int t3;
			scanf("%d", &t3);
			v.push_back(t3);
			s.insert(t3);
		}
		bool flag = 1, fg = 1;
		for (int j = 0; j < n; j++) {
			for (int u = 0; u < n; u++) {
				if (graph[v[j]][v[u]] == 0 || graph[v[u]][v[j]] == 0) flag = 0;
			}
		}
		for (int j = 1; j <= nv; j++) {
			if (s.find(j) == s.end()) {
				bool ismax = 0;
				for (int u = 0; u < n; u++) {
					if (graph[j][v[u]] == 0) ismax = 1;
				}
				if (ismax == 0) {
					fg = 0;
					break;
				}
			}
		}
		if (flag == 1) {
			if (fg == 1) printf("Yes\n");
			else printf("Not Maximal\n");
		}
		else printf("Not a Clique\n");
	}
	return 0;
}