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. Amaximal 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 <set>
using namespace std;
int nv, ne, m, edge[201][201], n[201], a, b, k;
set<int>s;
int Judge() {
	for (int i = 0; i < k; i++) 
		for (int j = i+1; j < k; j++) 
			if (edge[n[i]][n[j]] != 1)
				return 0;
	return 1;
}
int main() {
	cin >> nv >> ne;
	for (int i = 0; i < ne; i++) {
		cin >> a >> b;
		edge[a][b] = edge[b][a] = 1;
	}
	cin >> m;
	for (int i = 0; i < m; i++) {
		cin >> k;
		s.clear();
		for (int j = 0; j < k; j++) {
			cin >> a;
			s.insert(a);
			n[j] = a;
		}
		if (Judge()) {
			bool flag = true;
			for (int i = 1; i <= nv; i++) {
				int count = 0;
				if (s.find(i) == s.end())
					for (int j = 0; j < s.size(); j++)
						if (edge[i][n[j]] == 1)
							count++;
				if (count == s.size()) {
					flag = false;
					cout << "Not Maximal" << endl;
					break;
				}
			}
			if (flag) {
				cout << "Yes" << endl;
			}
		}
		else cout << "Not a Clique" << endl;
	}
	system("pause");
	return 0;
}