甲级PAT 1142 Maximal Clique （25 分）（bfs）

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<bits/stdc++.h>
using namespace std;

int G[210][210];
int book[210],nv;
vector<int> vlist;

int bfs(){
	queue<int> q;
	int u=vlist[0];
	q.push(u);
	book[u]=1;
	int num=0;
	while(!q.empty()){
		int top=q.front();
		q.pop();
		num++;
		for(int i=0;i<vlist.size();i++){
			int v=vlist[i];
			if(book[v]==0 && G[top][v]==1){
				book[v]=1;
				q.push(v);
			}
		}
	}
	return num;
}

bool isClique(){
	for(int i=0;i<vlist.size();i++){
		int num=0;
		int u=vlist[i];
		for(int j=0;j<vlist.size();j++){
			int v=vlist[j];
			if(G[u][v]==1) num++;
		}
		if(num!=vlist.size()-1) return false;
	}
	return true;
}

int main(){
	int ne,i,u,v,k,m,j;
	cin>>nv>>ne;
	memset(G,0,sizeof(G));
	for(i=0;i<ne;i++){
		cin>>u>>v;
		G[u][v]=G[v][u]=1;
	}
	cin>>k;
	for(i=0;i<k;i++){
		cin>>m;
		vlist.clear();
		memset(book,0,sizeof(book));
		for(j=0;j<m;j++){
			cin>>u;
			vlist.push_back(u);
		}
		int num=bfs();
		if(num!=m || !isClique()) cout<<"Not a Clique"<<endl;
		else{
			for(j=1;j<=nv;j++){
				if(book[j]==0){
					vlist.push_back(j);
					if(isClique()){
						cout<<"Not Maximal"<<endl;
						break;
					} 
					vlist.pop_back();
				}
			}
			if(j==nv+1) cout<<"Yes"<<endl;
		}		
	}	
	return 0;
}