【题解】【PAT甲】 1139 First Contact (30 分)（测试点1,2,3,4,5）

最新推荐文章于 2022-03-16 19:02:12 发布

原创

最新推荐文章于 2022-03-16 19:02:12 发布 · 1.4k 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#算法

本文解析了早期社交中男孩女孩微妙示爱方式的程序设计问题，介绍了如何通过网络帮助A与B建立联系，包括同性与异性之间的区别处理策略。关键在于理解朋友间的连通性和性别匹配规则。

题目链接

PTA | 程序设计类实验辅助教学平台

题目描述

Unlike in nowadays, the way that boys and girls expressing their feelings of love was quite subtle in the early years. When a boy A had a crush on a girl B, he would usually not contact her directly in the first place. Instead, he might ask another boy C, one of his close friends, to ask another girl D, who was a friend of both B and C, to send a message to B -- quite a long shot, isn't it? Girls would do analogously.

Here given a network of friendship relations, you are supposed to help a boy or a girl to list all their friends who can possibly help them making the first contact.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers N (1 < N ≤ 300) and M, being the total number of people and the number of friendship relations, respectively. Then M lines follow, each gives a pair of friends. Here a person is represented by a 4-digit ID. To tell their genders, we use a negative sign to represent girls.

After the relations, a positive integer K (≤ 100) is given, which is the number of queries. Then K lines of queries follow, each giv