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 1Sample Output:
Yes Yes Yes Yes Not Maximal Not a Clique
题目大意:
代码:
#include<stdio.h>
#include<string.h>
int Map[210][210];
int v[210];
int visited[210];
int main()
{
int i,j,n,m,k,t,x,y,l,num;
scanf("%d %d",&n,&m);
for(i=0;i<m;i++)
{
scanf("%d %d",&x,&y);
Map[x][y]=Map[y][x]=1;
}
scanf("%d",&k);
for(i=0;i<k;i++)
{
scanf("%d",&t);
memset(visited,0,sizeof(visited));
for(j=0;j<t;j++)
{
scanf("%d",&v[j]);
visited[v[j]]=1;
}
for(j=0;j<t;j++)
{
for(l=j+1;l<t;l++)
{
if(Map[v[j]][v[l]]!=1)
{
break;
}
}
if(l<t)
{
break;
}
}
if(j<t)
{
printf("Not a Clique\n");
}
else
{
num=0;
for(j=1;j<=n;j++)
{
if(visited[j]==0)
{
for(l=0;l<t;l++)
{
if(Map[j][v[l]]==0)
{
break;
}
}
if(l>=t)
{
printf("Not Maximal\n");
break;
}
}
}
if(j>n)
{
printf("Yes\n");
}
}
}
return 0;
}