PAT-1142 Maximal Clique

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<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;

bool g[250][250]={0};
int main(){
	int nv,ne;
	scanf("%d %d",&nv,&ne);
	for(int i=0;i<ne;i++){
		int a,b;
		scanf("%d %d",&a,&b);
		g[a][b]=true;
		g[b][a]=true;
	}
	int m;
	scanf("%d",&m);
	for(int i=0;i<m;i++){
		int k;
		scanf("%d",&k);
		int t;
		vector<int> tmp;
		for(int j=0;j<k;j++){
			scanf("%d",&t);
			tmp.push_back(t);
		}
		int count[250]={0};
		for(int j=0;j<tmp.size();j++){
			int v=tmp[j];
			for(int n=1;n<=nv;n++){
				if(g[v][n]){
					count[n]++;
				}
			}
		}
		bool ok=true;
		for(int j=0;j<tmp.size();j++){
			if(count[tmp[j]]<tmp.size()-1){
				ok=false;break;
			}
		}
		bool ismax=true;
		if(ok){
			for(int n=1;n<=nv;n++){
				if(count[n]==tmp.size()){
					ismax=false;break;
				}
			}
		}
		if(ok){
			if(ismax)printf("Yes\n");
			else printf("Not Maximal\n");
		}else{
			printf("Not a Clique\n");
		}
	}

	return 0;
}