2019冬季PAT甲级第三题

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