PAT 1139 First Contact (30分) （细节题）

1139 First Contact (30分)

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 Outputs

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

分析

这个题是个细节题。刚草草读完题目，以为是个并查集，于是开始写Find，Union，结果后来发现原来根本不是并查集。题目的意思是输入A,B两个人的ID，然后去找A的同性朋友C，B的同性朋友D，且C和D是好朋友。所以就用map存储两个人的关系就好了。

代码

#include <iostream>
#include <cstdio>
#include <string>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
int N,M;
map<int,vector<int>> graph;              //存储同性好友
map<pair<int,int>,bool> hascrush;        //存储异性关系
struct Node
{
    int x;
    int y;
    bool operator < (Node b)
    {
        if(x==b.x)
            return y<b.y;
        return x<b.x;
    }
};
int main()
{
    scanf("%d%d",&N,&M);
    while (M--)
    {
        string x,y;
        cin>>x>>y;
        int xx = stoi(x);
        int yy = stoi(y);
        xx = abs(xx);
        yy = abs(yy);
        if(x.length()==y.length())                     //同性别好朋友
        {    
            graph[xx].push_back(yy);
            graph[yy].push_back(xx);
        }
        hascrush[make_pair(xx,yy)] = true;
        hascrush[make_pair(yy,xx)] = true;
    }   
    int K;
    scanf("%d",&K);
    while(K--)
    {
        string x,y;
        cin>>x>>y;
        int xx = abs(stoi(x));
        int yy = abs(stoi(y));
        vector<Node> ans;
        for(int i=0;i<graph[xx].size();i++)
        {
            int idx = graph[xx][i];                   //第一个人的同性朋友
            for(int j=0;j<graph[yy].size();j++)
            {
                int idy = graph[yy][j];               //第二个人的同性朋友
                if(idx==yy||idy==xx)                  //排除掉第一个人的同性别朋友和第二个人是同一人
                    continue;
                if(hascrush[make_pair(idx,idy)])     //第一个人的朋友如果和第二个人的朋友是朋友则加入ans数组中
                {
                    ans.push_back(Node{idx,idy});
                }
            }
        }
        sort(ans.begin(),ans.end());
        printf("%d\n",ans.size());
        for(int i=0;i<ans.size();i++)
        {
            printf("%04d %04d\n",ans[i].x,ans[i].y);
        }
    }
    return 0;
}