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>

using namespace std;
const int maxn = 206;

int e[maxn][maxn];

int main()
{
	//freopen("in.txt", "r", stdin);
	int nv, ne,m,k;
	cin >> nv >> ne;
	for (int i = 0; i < ne; i++)
	{
		int a, b;
		cin >> a >> b;
		e[a][b] = e[b][a] = 1;
	}
	cin >> m;
	for (int i = 0; i < m; i++)
	{
		cin >> k;
		vector<int> v(k);
		int hash[maxn] = { 0 }, isclique = 1, ismaximal = 1;
		for (int j = 0; j < k; j++)
		{
			cin >> v[j];
			hash[v[j]] = 1;
		}
		for (int j = 0; j < k; j++)
		{
			if (isclique==0)
			{
				break;
			}
			for (int t = j+1; t < k; t++)
			{
				if (e[v[j]][v[t]]==0)
				{
					isclique = 0;
					cout << "Not a Clique" << endl;
					break;
				}
			}
		}
		if (isclique==0)
		{
			continue;
		}
		for (int j = 1; j <= nv; j++)
		{
			if (hash[j]==0)
			{
				for (int l = 0; l < k; l++)
				{
					if (e[v[l]][j]==0)
					{
						break;
					}
					if (l==k-1)//说明有个点可以加入，和其他点都相邻。
					{
						ismaximal = 0;
					}
				}
			}
			if (ismaximal==0)
			{
				cout << "Not Maximal" << endl;
				break;
			}
		}
		if (ismaximal==1)
		{
			cout << "Yes" << endl;
		}
	}
	return 0;
}