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，即判断是否任意两边都相连, 之后判断是否是maximal， 即遍历所有不在集合中的剩余点,看是否存在一个点满足和集合中所有的节点相连

#include<bits/stdc++.h>
using namespace std;
int e[210][210];
int main() {
	int nv, ne, a, b, m, k;
	scanf("%d %d", &nv, &ne);
	for (int i = 0; i < ne; i++) {
		scanf("%d %d", &a, &b);
		e[a][b] = e[b][a] = 1;
	}
	scanf("%d", &m);
	for (int i = 0; i < m; i++) {
		scanf("%d", &k);
		int isClique = 1, isMaximal = 1;
		vector<int> v(k);
		int hash[210] = {0};
		for (int j = 0; j < k; j++) {
			scanf("%d", &v[j]);
			hash[v[j]] = 1;
		}
		for (int j = 0; j < k; j++) {
			if (isClique == 0) break;
			for (int u = j + 1; u < k; u++) {
				if (e[v[j]][v[u]] == 0) {
					isClique = 0;
					printf("Not a Clique\n");
					break;
				}
			}
		}
		if (isClique == 0) continue;
		for (int j = 1; j <= nv; j++) {
			if (hash[j] == 0) {
				for (int u = 0; u < k; u++) {
					if (e[v[u]][j] == 0) break;
					if (u == k - 1) isMaximal = 0;
				}
			}
			if (isMaximal == 0) {
				printf("Not Maximal\n");
				break;
			}
		}
		if (isMaximal) printf("Yes\n");
	}
	return 0;
}