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
1 #include <iostream> 2 #include <vector> 3 #include <string> 4 #include <algorithm> 5 using namespace std; 6 vector<int>graph[10005];//图 7 bool boy[10005];//下标为ID，元素表示该ID是否是男 8 int N, M, K, vstart, vend; 9 int main() 10 { 11 scanf("%d%d", &N, &M); 12 for (int i = 0; i < M; ++i) 13 {//读取边的数据 14 string a, b; 15 cin >> a >> b; 16 int ia = abs(stoi(a)), ib = abs(stoi(b));//将字符串化为正整数 17 graph[ia].push_back(ib);//向图中加入边 18 graph[ib].push_back(ia);//向图中加入边 19 boy[ia] = (a[0] != '-');//表示该人性别 20 boy[ib] = (b[0] != '-');//表示该人性别 21 } 22 scanf("%d", &K); 23 while (K--) 24 { 25 scanf("%d%d", &vstart, &vend);//读取首尾结点 26 vector<pair<int, int>>result;//存储符合题目要求的两个结点 27 for (int i : graph[abs(vstart)])//遍历首节点的朋友 28 if (i != abs(vend) && i != abs(vstart) && boy[i] == boy[abs(vstart)])//找到非首尾结点且与首节点性别相同的朋友作为第一个节点 29 for (int j : graph[i])//遍历第一个节点的朋友 30 if (j != abs(vend) && j != abs(vstart) && boy[j] == boy[abs(vend)])//找到非首尾结点且与尾节点性别相同的朋友作为第二个节点 31 for (int k : graph[j])//遍历第二个节点的朋友 32 if (k == abs(vend))//尾结点是第二个节点的朋友 33 result.push_back({ i,j });//i,j两个节点符合要求 34 printf("%d\n", result.size()); 35 sort(result.begin(), result.end());//排序 36 for (auto&i : result)//输出 37 printf("%04d %04d\n", i.first, i.second); 38 } 39 return 0; 40 }