1166 Summit

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<cstring>
using namespace std;
const int N = 210;
int n,m;
int p[N];
bool g[N][N],st[N];
bool check(int cnt){
    for(int i = 0;i+1<cnt;i++){
        if(!g[p[i]][p[i+1]])return false;
    }
    return true;
}
bool is_ok(int cnt,int &idx){
    for(int i = 1;i<=n;i++){
        if(!st[i]){
            int j;
            for(j = 0;j<cnt;j++){
                if(!g[i][p[j]])break;
            }
            if(j==cnt){
                idx = i;
                return false;
            }
        }
    }
    return true;
}
int main(){
    cin>>n>>m;
    for(int i = 0;i<m;i++){
        int a,b;cin>>a>>b;
        g[a][b] = g[b][a] = 1;
    }
    int k;cin>>k;
    for(int i = 1;i<=k;i++){
        int cnt;cin>>cnt;
        memset(p,0,sizeof p);
        memset(st,0,sizeof st);
        for(int j = 0;j<cnt;j++){
            cin>>p[j];
            st[p[j]] = 1;
        }
        if(!check(cnt))printf("Area %d needs help.\n",i);
        else{
            int idx;
            if(is_ok(cnt,idx))printf("Area %d is OK.\n",i);
            else printf("Area %d may invite more people, such as %d.\n",i,idx);
        }
    }
}