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)N (≤ 200)N(≤200), the number of heads in the summit, and MMM, the number of friendship relations. Then MMM lines follow, each gives a pair of indices of the heads who are friends to each other. The heads are indexed from 111 to NNN.

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:

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.

类似于最大团PAT1142 Maximal Clique

#include <bits/stdc++.h>
using namespace std;
const int N = 205;
int G[N][N];
int n, m;
int arr[N];
unordered_set<int> st;
int judge(int l){for(int i = 0; i < l; i++){for(int j = i+1; j < l; j++){if(G[arr[i]][arr[j]] == 0) return -1;}}//have edgefor(int i = 1; i <= n; i++){if(!st.count(i)){bool flag = false;for(int j = 0; j < l; j++){int v = arr[j];if(!G[v][i]) flag = true;}if(!flag) return i;}}return 0;
}
int main(){int k, l, x, u, v;scanf("%d%d", &n, &m);memset(G, 0, sizeof G);while(m--){scanf("%d%d", &u, &v);G[u][v] = 1;G[v][u] = 1;}scanf("%d", &k);for(int i = 1; i <= k; i++){st.clear();scanf("%d", &l);for(int j = 0; j < l; j++){scanf("%d", &arr[j]);st.insert(arr[j]);}int res = judge(l);if(res == 0){printf("Area %d is OK.\n", i);}else if(res == -1){printf("Area %d needs help.\n", i);}else{printf("Area %d may invite more people, such as %d.\n", i, res);}}return 0;
}

7-3 Summit (25分)相关推荐

7-3 Summit (25分)
7-3 Summit (25分) A summit (峰会) is a meeting of heads of state or government. Arranging the rest area ...
19年冬季第二题 PAT甲级 1166 Summit (25分)
7-3 Summit (25分) A summit (峰会) is a meeting of heads of state or government. Arranging the rest area ...
1166 Summit (25 分) PAT
A summit (峰会) is a meeting of heads of state or government. Arranging the rest areas for the summit ...
PAT A1162 7-3 Summit (25分)
A summit (峰会) is a meeting of heads of state or government. Arranging the rest areas for the summit ...
PAT 甲级1166（图）Summit (25分)
A summit (峰会) is a meeting of heads of state or government. Arranging the rest areas for the summit ...
PAT (Advanced Level) Practice 1166 Summit (25 分)
题目因为只是判断是否是直接相连,所以觉得直接用暴力模拟,而且数据范围也很小.果然,许久不练题,A题的效率都下降了.不过,练题真的是打发时间的好途径. #include <bits/stdc++ ...
PAT甲级——1166 Summit (25 分)
思路: 模拟,用两位vector表示edge相连关系然后,看是否两两相连和是否有其他点与其都相连 src // 不需要并查 #include<bits/stdc++.h> using n ...
12门课100分直博清华！这份成绩单冲上热搜，但学霸小伙也曾考过25分
点击上方"视学算法",选择加"星标"或"置顶" 重磅干货,第一时间送达金磊明敏发自凹非寺量子位报道 | 公众号 QbitAI 一 ...
PTA 7-3 旅游规划 (25分)（双权值Dijkstra最短路）
7-3 旅游规划 (25分) 有了一张自驾旅游路线图,你会知道城市间的高速公路长度.以及该公路要收取的过路费.现在需要你写一个程序,帮助前来咨询的游客找一条出发地和目的地之间的最短路径.如果有若干条路 ...

7-3 Summit (25分)

7-3 Summit (25分)相关推荐

最新文章

热门文章