7-3 Summit (25分)

A summit (峰会) is a meeting of heads of state or government. Arranging the rest areas for the summit is not a simple job. The ideal arrangement of one area is to invite those heads so that everyone is a direct friend of everyone.

Now given a set of tentative arrangements, your job is to tell the organizers whether or not each area is all set.

Input Specification:
Each input file contains one test case. For each case, the first line gives two positive integers $N(\le 200)$, the number of heads in the summit, and $M$, the number of friendship relations. Then $M$ lines follow, each gives a pair of indices of the heads who are friends to each other. The heads are indexed from $1$ to $N$.

Then there is another positive integer K (≤ 100), and K lines of tentative arrangement of rest areas follow, each first gives a positive number L (≤ N), then followed by a sequence of L distinct indices of the heads. All the numbers in a line are separated by a space.

Output Specification:
For each of the K areas, print in a line your advice in the following format:

if in this area everyone is a direct friend of everyone, and no friend is missing (that is, no one else is a direct friend of everyone in this area), print Area X is OK..

if in this area everyone is a direct friend of everyone, yet there are some other heads who may also be invited without breaking the ideal arrangement, print Area X may invite more people, such as H. where H is the smallest index of the head who may be invited.

if in this area the arrangement is not an ideal one, then print Area X needs help. so the host can provide some special service to help the heads get to know each other.

Here X is the index of an area, starting from 1 to K.

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
2 4 6
3 3 2 1

Sample Output:

Area 1 is OK.
Area 2 is OK.
Area 3 is OK.
Area 4 is OK.
Area 5 may invite more people, such as 3.
Area 6 needs help.

类似于最大团PAT1142 Maximal Clique

#include <bits/stdc++.h>
using namespace std;
const int N = 205; 
int G[N][N];
int n, m;
int arr[N];
unordered_set<int> st;
int judge(int l){
	
	for(int i = 0; i < l; i++){
		for(int j = i+1; j < l; j++){
			if(G[arr[i]][arr[j]] == 0) return -1;
		}
	}
	//have edge
	for(int i = 1; i <= n; i++){
		if(!st.count(i)){
			bool flag = false;
			for(int j = 0; j < l; j++){
				int v = arr[j];
				if(!G[v][i]) flag = true;
			}
			if(!flag) return i;
		}
	}
	return 0;
}
int main(){
	int k, l, x, u, v;
	scanf("%d%d", &n, &m);
	memset(G, 0, sizeof G);
	while(m--){
		scanf("%d%d", &u, &v);
		G[u][v] = 1;
		G[v][u] = 1;
	}
	scanf("%d", &k);
	for(int i = 1; i <= k; i++){
		st.clear();
		scanf("%d", &l);
		for(int j = 0; j < l; j++){
			scanf("%d", &arr[j]);
			st.insert(arr[j]);
		}
		int res = judge(l);
		if(res == 0){
			printf("Area %d is OK.\n", i);
		}else if(res == -1){
			printf("Area %d needs help.\n", i);
		}else{
			printf("Area %d may invite more people, such as %d.\n", i, res);
		}
	}
	return 0;
}