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, printNot 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
25分:
参考柳神代码:
注意点:
1. hash数组一定要初始化为0!
#include <iostream>
#include <vector>
using namespace std;
int g[201][201];
int nv, ne, m, k;
int main()
{
scanf("%d %d", &nv, &ne);
for (int i = 0; i < ne; i++)
{
int s, e;
scanf("%d %d", &s, &e);
g[s][e] = g[e][s] = 1;
}
scanf("%d", &m);
for (int i = 0; i < m; i++)
{
scanf("%d", &k);
vector<int> v(k);
int hash[201] = {0},is_clique = 1, is_max = 1;
for (int j = 0; j < k; j++)
{
scanf("%d", &v[j]);
hash[v[j]] = 1;
}
for (int j = 0; j < k; j++)
{
if (is_clique == 0) break;
for (int l = j + 1; l < k; l++)
{
if (g[v[j]][v[l]] == 0)
{
is_clique = 0;
printf("Not a Clique\n");
break;
}
}
}
if(is_clique == 0) continue;
for (int j = 1; j <= nv; j++)
{
if (hash[j] == 0)
{
for (int l = 0; l < k; l++)
{
if(g[v[l]][j] == 0) break; //到其中任何一个没有边,都不行
if (l == k - 1) is_max = 0; //全部有边,不是max
}
}
if (is_max == 0)
{
printf("Not Maximal\n");
break;
}
}
if(is_max == 1) printf("Yes\n");
}
return 0;
}