1142. Maximal Clique (25)

1142. Maximal Clique (25)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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<string.h>
#include<vector>
using namespace std;
vector<int>adj[210];
int cou[210];
int main(){
	int n,m,i,j,k,c1,c2,query,x;
	scanf("%d %d",&n,&m);
	for(i=0;i<m;i++){
		scanf("%d %d",&c1,&c2);
		adj[c1].push_back(c2);
		adj[c2].push_back(c1);
	}
	scanf("%d",&query);
	while(query--){
		scanf("%d",&k);
		vector<int>tmp;
		for(i=0;i<210;i++){
			cou[i]=0;
		}
		for(i=0;i<k;i++){
			scanf("%d",&x);
			tmp.push_back(x);
		}
		for(i=0;i<tmp.size();i++){
			int now=tmp[i];
			for(j=0;j<adj[now].size();j++){
				cou[adj[now][j]]++;//统计邻接节点出现次数 
			}
		}
		int in=0;
		for(i=0;i<tmp.size();i++){
			if(cou[tmp[i]]==k-1){//Clique每个结点都能被其他k-1个邻接 
				in++;
			}
		}
		if(in==k){//保证至少是Clique 
			int inin=0;
			for(i=1;i<=n;i++){
				if(cou[i]==k){//存在其他结点，邻接这K个结点，所以不是Maximal 
					inin++;
				}
			}
			if(inin){
				printf("Not Maximal\n");
			}
			else{
				printf("Yes\n");
			}
		}
		else{
			printf("Not a Clique\n");
		}
	}
}