1166 Summit （PAT甲级）

#include <cstdio>
#include <algorithm>
#include <vector>
const int MAXN = 201;

int N, M, K, L, u, v;
std::vector<int> vec;
int friends[MAXN][MAXN];
bool flag;

void judge(int k){
    for(int i = 1; i <= N; ++i){
        for(int j = i + 1; j <= N; ++j){
            if(vec[i] && vec[j] && !friends[i][j]){
                printf("Area %d needs help.\n", k);
                return;
            }
        }
    }
    for(int i = 1; i <= N; ++i){
        if(!vec[i]){
            flag = true;
            for(int j = 1; j <= N; ++j){
                if(vec[j] && !friends[i][j]){
                    flag = false;
                    break;
                }
            }
            if(flag){
                printf("Area %d may invite more people, such as %d.\n", k, i);
                return;
            }
        }
    }
    printf("Area %d is OK.\n", k);
}

int main(){
    scanf("%d %d", &N, &M);
    vec.resize(N + 1);
    std::fill(friends[0], friends[0] + MAXN * MAXN, 0);
    for(int i = 0; i < M; ++i){
        scanf("%d %d", &u, &v);
        friends[u][v] = 1;
        friends[v][u] = 1;
    }
    scanf("%d", &K);
    for(int i = 1; i <= K; ++i){
        scanf("%d", &L);
        std::fill(vec.begin(), vec.end(), 0);
        for(int j = 0; j < L; ++j){
            scanf("%d", &u);
            vec[u] = 1;
        }
        judge(i);
    }
    return 0;
}

题目如下：

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.