【PAT】A1142 Maximal Clique (25分)

作者: CHEN, Yue
单位: 浙江大学
时间限制: 400 ms
内存限制: 64 MB
代码长度限制: 16 KB

A1142 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

Code

#include <bits/stdc++.h>
using namespace std;
vector<int> seq;
int g[210][210];
int main(){
    int nv,ne,m,k,u,v;
    scanf("%d %d",&nv,&ne);
    for(int i=0;i<ne;i++){
        scanf("%d %d",&u,&v);
        g[u][v]=g[v][u]=1;
    }
    scanf("%d",&m);
    for(int i=0;i<m;i++){
        scanf("%d",&k);
        seq.clear();
        seq.resize(k);
        int flag1=0,flag2=0;
        for(int j=0;j<k;j++)    scanf("%d",&seq[j]);
        for(int a=0;a<seq.size();a++){
            for(int b=0;b<seq.size();b++){
                if(a==b)    continue;
                if(g[seq[a]][seq[b]]!=1)    flag1=1;
            }
        }
        for(int a=1;a<=nv;a++){
            int cnt=0;
            for(int b=0;b<seq.size();b++){
                if(a==seq[b])   continue;
                if(g[a][seq[b]]==1) cnt++;
            }
            if(cnt==seq.size()) flag2=1;
        }
        if(flag1==1)    printf("Not a Clique\n");
        else if(flag2==1)  printf("Not Maximal\n");
        else    printf("Yes\n");
    }
    return 0;
}

Analysis

-已知一张无向图的连通情况。并给出M组结点。

-判断每组结点是否两两直接相连。如果每组结点两两直接相连（或者只有一个结点），并且图中其他任何点加入都会破坏结点两两直接相连的条件，则输出Yes。若存在其他结点加入，还使得结点两两直接相连成立，则输出Not Maximal。若该组结点两两没有直接相连，则输出Not a Clique。