1139 First Contact(30 分)(C++)

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 gives a pair of lovers, separated by a space. It is assumed that the first one is having a crush on the second one.

Output Specification:

For each query, first print in a line the number of different pairs of friends they can find to help them, then in each line print the IDs of a pair of friends.

If the lovers A and B are of opposite genders, you must first print the friend of A who is of the same gender of A, then the friend of B, who is of the same gender of B. If they are of the same gender, then both friends must be in the same gender as theirs. It is guaranteed that each person has only one gender.

The friends must be printed in non-decreasing order of the first IDs, and for the same first ones, in increasing order of the seconds ones.

Sample Input:

10 18
-2001 1001
-2002 -2001
1004 1001
-2004 -2001
-2003 1005
1005 -2001
1001 -2003
1002 1001
1002 -2004
-2004 1001
1003 -2002
-2003 1003
1004 -2002
-2001 -2003
1001 1003
1003 -2001
1002 -2001
-2002 -2003
5
1001 -2001
-2003 1001
1005 -2001
-2002 -2004
1111 -2003

Sample Output:

4
1002 2004
1003 2002
1003 2003
1004 2002
4
2001 1002
2001 1003
2002 1003
2002 1004
0
1
2003 2001
0

题目大意:给定一个图,然后给一些一对节点,要给这两个节点分别找出所有的属性与各自他们属性相同的节点对,这两个节点x直接相通。其实属性存储什么千万别想的太麻烦。在存储的时候,就将不同的路径按照节点端点属性是否相同存储好。因为要找的节点对属性一个与各自属性相同,那么就剩找出的这个节点对的属性是否相同。

解题思路:用gender存储每个id的性别(其实不存储也没关系,本题只关注两个节点的性别是否相同,但是由于0的存在,输入的时候必须用字符型,索性干脆存储了一下性别,唯一的好处就是在判断的时候,输入的两节点可以直接用int型)。针对每个节点不管男女,只分与他性别相同,或不同两种存储。

两种情况:

1、给出的a,b节点对同属性,那么找出的节点属性相同。

针对a节点的same中的同性好友,去找每个x的same中的同性好友是否有b的同性好友

注意点:有可能给出的两个节点本身就是相通,但是对方并不能作为结果。

2、给出的节点对不同属性,那么找出的节点属性不相同。

针对a节点的same中的同性好友x,去找每个x的diif中的异性好友是否有b的同性好友

#include <iostream>
#include <string>
#include <set>
#include <cmath>
#include <vector>
using namespace std;
set<int>diff[10005], same[10005];
int main(){
	int n, m, k;
	scanf("%d %d", &n, &m);
	for(int i = 0; i < m; ++ i){
		string a, b;
		cin >> a >> b;
		int tempa = abs(stoi(a)), tempb = abs(stoi(b));
		if(a.length() != b.length()){
			diff[tempa].insert(tempb);
			diff[tempb].insert(tempa);
		}
		else{
			same[tempa].insert(tempb);
			same[tempb].insert(tempa);
		}
	}
	scanf("%d", &k);
	for(int i = 0; i < k; ++ i){
		string a, b;
		cin >> a >> b;
		int tempa = abs(stoi(a)), tempb = abs(stoi(b));
		vector<pair<int, int>>ans;
		if(a.length() == b.length()){
			for(auto it = same[tempa].begin(); it != same[tempa].end(); ++ it){
				for(auto it2 = same[*it].begin(); it2 != same[*it].end(); ++ it2)
					if(*it != tempb && *it2 !=tempa && same[tempb].find(*it2) != same[tempb].end())
						ans.push_back(make_pair(*it, *it2));
			}
		}
		else{
			for(auto it = same[tempa].begin(); it != same[tempa].end(); ++ it){
				for(auto it2 = diff[*it].begin(); it2 != diff[*it].end(); ++ it2)
					if(same[tempb].find(*it2) != same[tempb].end())
						ans.push_back(make_pair(*it, *it2));
			}
		}
		printf("%d\n", ans.size());
		for(int i = 0;i < ans.size(); ++ i)
			printf("%04d %04d\n", ans[i].first, ans[i].second);
	}
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值