2019冬季PAT甲级第三题

#define HAVE_STRUCT_TIMESPEC
#include<bits/stdc++.h>
using namespace std;
set<int>v[207];
int a[207];
int vis[207];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=m;++i){
        int x,y;
        cin>>x>>y;
        v[x].insert(y);
        v[y].insert(x);
    }
    int k;
    cin>>k;
    for(int i=1;i<=k;++i){
        int num;
        cin>>num;
        if(num==0){
            cout<<"Area "<<i<<" needs help.";
                cout<<"
";
            continue;
        }
        for(int j=1;j<=num;++j)
            cin>>a[j];
        int flag=0;
        for(int k=1;k<=num;++k){
            for(int j=1;j<=num;++j){
                if(k==j)
                    continue;
                if(!v[a[k]].count(a[j])){
                    flag=1;
                }
            }
        }
        if(flag){
            cout<<"Area "<<i<<" needs help.";
                cout<<"
";
            continue;
        }
        memset(vis,0,sizeof(vis));
        for(int j=1;j<=num;++j){
            for(auto it:v[a[j]])
                ++vis[it];
        }
        int ans=0;
        for(int j=1;j<=n;++j)
            if(vis[j]==num){
                ans=j;
                break;
            }
        if(ans){
            cout<<"Area "<<i<<" may invite more people, such as "<<ans<<".";
                cout<<"
";
            continue;
        }
        cout<<"Area "<<i<<" is OK.";
        cout<<"
";
    }
    return 0;
}