7-3 Summit (25分)

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 (≤ 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.

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int   mp[209][209],vis[209]; 
bool  checkALL(  vector<int> &v ){
	  int isideal = 1 ;
	  for( int i=1 ; i<v.size();i++ ){
	  	   for( int j=i+1;j<v.size();j++){
	  	        if( !mp[ v[i] ][ v[j] ] ){
	  	             isideal = 0;
					 break; 	
				} 	    	
		   }
		   if( !isideal )
		       break;
	  }
	  if( !isideal )
	      return false;
	  return true;
}

int find(int n , vector<int>&v){
	for( int i=1;i<=n;i++ ){
		 if( vis[i] )
		     continue;
		 vector<int> vv = v;
		 vv.push_back( i );
		 if( checkALL( vv ) )
		     return i;
	} 
	return -1;
}
int main(void){
	int n,m,a,b;
	cin>>n>>m;
	for( int i=1;i<=m;i++){
		 cin>>a>>b;
		 mp[a][b] = 1 ;
		 mp[b][a] = 1 ;
	}
	int k,l;
	cin>>k;
	for( int i=1;i<=k;i++){
	     cin>>l;
		 vector<int> v(l+1);
		 fill( vis , vis +209,0);
		 for( int j=1;j<=l;j++){
		 	  cin>>v[j];
		 	  vis[ v[j] ] =1;
		 }
		 if(  !checkALL( v ) )
		      cout<<"Area "<<i<<" needs help."<<endl; 
	     else {
	     	 int small = find(n, v );
			 if(  small ==-1 )
			      cout<<"Area "<<i<<" is OK."<<endl;
			 else cout<<"Area "<<i<<" may invite more people, such as "<<small<<"."<<endl; 
		 }
	}	
	return 0;
}