|加顶点判断图的连通性-有边|19冬第三题1166 Summit (25分) 1142

//判断强连通图，如果是，
//再判断不在给定节点里的节点，有没有加进来依然属于强连通图的。
//题目规模很小，用邻接矩阵比较方便。
//每一组方案用bool变量来保存确定的判断结果以及及时break。
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int const maxn = 1010;

int n, m;
int G[maxn][maxn] = { 0 };
vector<int>v;

int dfs() {
	
	for (int i = 0; i < v.size(); i++) {
		for (int j = i+1; j < v.size(); j++) {
			if (G[v[i]][v[j]] != 1) {
				return -1;
			}
		}
	}

	//求编号最小的共同好友
	//把一个个编号加进去图，看看还这个编号和原来图的每个顶点有边吗，有的话就是ans
	for (int j = 1; j <=n; j++) {
		bool flag = true;
		if (find(v.begin(), v.end(), j) == v.end()) {
			for (int i = 0; i < v.size(); i++) {
				if (G[v[i]][j] != 1) {
					flag = false;
				}
			}
		}
		else continue;
		if (flag == true)
			return j;
	}

	return 202;
}

int main() {

	cin >> n >> m;

	for (int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		G[a][b] = 1;
		G[b][a] = 1;
	}

	int k;
	cin >> k;

	for (int i = 0; i < k; i++) {
		int l;
		cin >> l;
		v.clear();

		for (int j = 0; j < l; j++) {
			int tmp_v;
			cin >> tmp_v;
			v.push_back(tmp_v);
		}
		
		int ans = dfs();
		if (ans == -1)cout << "Area " << i + 1 << " needs help.\n";
		else if(ans==202)cout<< "Area " << i + 1 << "is OK.\n";
		else cout << "Area " << i + 1 << " may invite more people, such as "<<ans<<".\n";
	}
	return 0;
}
/*
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
*/