常规方法把题意翻译成代码即可,时间和空间范围足够,用set容器来加入和查找朋友。
如果是后面三个测点没有通过,可能遗漏了一个细节:a和b也可能是朋友,但是c!=b,在遍历a的朋友时需要注意这一点。
#include<stdio.h>
#include<set>
#include<vector>
#include<algorithm>
#include<math.h>
using namespace std;
typedef pair<int, int> P;
vector<P> ans;
set<int> relations[10000];
int gender[10000];
bool cmp(P a, P b)
{
if (a.first != b.first)
{
return (a.first < b.first);
}
else
{
return (a.second < b.second);
}
}
int main()
{
int N, M;
scanf("%d%d", &N, &M);
for (int i = 0; i < M; i++)
{
char ac[6], bc[6];
scanf("%s%s", ac, bc);
int a = abs(atoi(ac));
int b = abs(atoi(bc));
if (ac[0] == '-') gender[a] = -1;
else gender[a] = 1;
if (bc[0] == '-') gender[b] = -1;
else gender[b] = 1;
relations[a].insert(b);
relations[b].insert(a);
}
int K;
scanf("%d", &K);
for (int i = 0; i < K; i++)
{
int a, b;
scanf("%d%d", &a, &b);
a = abs(a);
b = abs(b);
ans.clear();
set<int>::iterator iter;
for (iter = relations[a].begin(); iter != relations[a].end(); iter++)
{
int c = *iter;
if (gender[a] * gender[c] == -1 || c == b)
{
continue;
}
set<int>::iterator jter;
for (jter = relations[b].begin(); jter != relations[b].end(); jter++)
{
int d = *jter;
if (gender[b] * gender[d] == -1 || d == a)
{
continue;
}
if (relations[c].count(d) == 1)
{
ans.push_back(P(c, d));
}
}
}
sort(ans.begin(), ans.end(), cmp);
printf("%d\n", ans.size());
for (int j = 0; j < ans.size(); j++)
{
printf("%04d %04d\n", ans[j].first, ans[j].second);
}
}
return 0;
}