PAT Grade --A1141 PATRankingofInstitution [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

Solution: 
　　meaning of the questions is, in a connected graph is given, the judge queried point is not twenty-two connected? If so, that's Clique, and then judge these queries is not the biggest point is set, that no other point point to a query pairwise connected 
　　if there is not the biggest collection
　　

 1 #include <iostream>
 2 #include <vector>
 3 using namespace std;
 4 int main()
 5 {
 6     int n, m, k;
 7     cin >> n >> m;
 8     vector<vector<int>>v(n + 1, vector<int>(n + 1, 0));
 9     while (m--)
10     {
11         int a, b;
12         cin >> a >> b;
13         v[a][b] = v[b][a] = 1;
14     }
15     cin >> k;
16     while (k--)
17     {
18         cin >> m;
19         vector<int>temp(m);
20         vector<bool>otherNum(n + 1, true);
21         for (int i = 0; i < m; ++i)
22         {
23             cin >> temp[i];
24             otherNum[temp[i]] = false;
 25          }
 26 is          BOOL In Flag = to true , isMax = to true ;
 27          for ( int I = 0 ; I <m && In Flag; I ++) // Analyzing query point is not connected twenty-two 
28              for ( int J = I + . 1 ; J <m; ++ J)
 29                  IF (V [TEMP [I]] [TEMP [J]] == 0 )
 30                      In Flag = to false ;
 31 is          IF (== In Flag to false )
 32              COUT << " Not A Clique "<< endl;
 33 is          the else 
34 is          {
 35              for ( int I = . 1 ; I <= n-&& isMax; I ++) // determines a point other than the query point to the query is not connected twenty-two 
36              {
 37 [                  IF ( otherNum [I] == to false ) Continue ; // points not determined in the query 
38 is                  int the nums = 0 ;
 39                  for ( int J = 0 ; J <m; ++ J)
 40                      IF (V [I] [TEMP [J]] == . 1 )
 41 is                          ++nums;
42                 if (nums == m)
43                     isMax = false;
44             }
45             if (isMax)
46                 cout << "Yes" << endl;
47             else
48                 cout << "Not Maximal" << endl;
49         }
50     }
51     return 0;
52 }