1139 First Contact (30 分)

unordered_map<int, bool> arr;

当hash表太大时候，用map代替

        arr[abs(stoi(a)) * 10000 + abs(stoi(b))] = arr[abs(stoi(b)) * 10000 + abs(stoi(a))] = true;

都是重复代码，全是细节问题，，25分，，

这些情况都是可以合并的，单向思维，从追求者一直找到被追求这，其实不管是男追男，追女，女追男等等，都是找自己的同性朋友，而且相当于四个节点三段关系，可以将同性朋友单独存起来，如何找追求者同性朋友与被追求者的同性朋友之间是否有联系，有联系就存起来

#include<bits/stdc++.h>
using namespace std;
bool isexist[10000] = { false };
int G[10000][10000] = { 0 }, flag = 0;
vector<int> girls, boys, res;
bool cmp(pair<int,int> a,pair<int,int> b)
{
    if(a.first!=b.first) return a.first<b.first;
    else return a.second<b.second;
}
void print_res(int cnt){
    cout << cnt << endl;
    int num = 0;
    pair<int,int> p[10000];
    for(int i=0;i<res.size();i+=2){
        p[num].first=res[i];
        p[num].second=res[i+1];
        num++;
    }
    sort(p,p+res.size()/2,cmp);
    for(int i=0;i<cnt;i++)
        printf("%04d %04d\n",p[i].first,p[i].second);
}
void ouba(int now, int b) {
    int cnt = 0;
    for (int i = 0; i < girls.size(); i++) {
        if (G[abs(now)][abs(girls[i])] == 1) {
            int meiren = abs(girls[i]);
            for (int j = 0; j < boys.size(); j++) {
                if (G[meiren][boys[j]] == 1) {
                    int meiren2 = boys[j];
                    for (int k = 0; k < boys.size(); k++) {
                        if (G[meiren2][abs(b)] == 1) {
                            cnt++;
                            res.push_back(abs(girls[i]));
                            res.push_back(boys[j]);
                            break;
                        }
                    }
                }
            }
        }
    }
    print_res(cnt);
}
void godess(int now, int b) {
    int cnt = 0;
    for (int i = 0; i < boys.size(); i++) {
        if (G[abs(now)][boys[i]] == 1) {
            int meiren = boys[i];
            for (int j = 0; j < girls.size(); j++) {
                if (G[meiren][abs(girls[j])] == 1) {
                    int meiren2 = abs(girls[j]);
                    for (int k = 0; k < girls.size(); k++) {
                        if (G[meiren2][abs(b)] == 1) {
                            cnt++;
                            res.push_back(boys[i]);
                            res.push_back(abs(girls[j]));
                            break;
                        }
                    }
                }
            }
        }
    }
    print_res(cnt);
}
void gay(int now, int b) {
    int cnt = 0;
    for (int i = 0; i < boys.size(); i++) {
        if (G[abs(now)][boys[i]] == 1&&b!=boys[i]) {
            int meiren = boys[i];
            for (int j = 0; j < boys.size(); j++) {
                if (G[meiren][abs(boys[j])] == 1) {
                    int meiren2 = abs(boys[j]);
                    for (int k = 0; k < boys.size(); k++) {
                        if (G[meiren2][abs(b)] == 1) {
                            cnt++;
                            res.push_back(boys[i]);
                            res.push_back(abs(boys[j]));
                            break;
                        }
                    }
                }
            }
        }
    }
    print_res(cnt);
}
void t(int now, int b) {
    int cnt = 0;
    for (int i = 0; i < girls.size(); i++) {
        if (G[abs(now)][abs(girls[i])] == 1&&b!=girls[i]) {
            int meiren = abs(girls[i]);
            for (int j = 0; j < girls.size(); j++) {
                if (G[meiren][abs(girls[j])] == 1) {
                    int meiren2 = abs(girls[j]);
                    for (int k = 0; k < girls.size(); k++) {
                        if (G[meiren2][abs(b)] == 1) {
                            cnt++;
                            res.push_back(abs(girls[i]));
                            res.push_back(abs(girls[j]));
                            break;
                        }
                    }
                }
            }
        }
    }
    print_res(cnt);
}
int main() {
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int a, b;
        string s1,s2;
        cin>>s1>>s2;
        a=stoi(s1);
        b=stoi(s2);
        if (s1.length() == 5 && isexist[abs(a)] == false) {
            isexist[abs(a)] = true;
            girls.push_back(a);
        }
        else if (isexist[abs(a)] == false) {
            boys.push_back(a);
            isexist[abs(a)] = true;
        }
        if (s2.length() == 5 && isexist[abs(b)] == false) {
            isexist[abs(b)] = true;
            girls.push_back(b);
        }
        else if (isexist[abs(b)] == false) {
            boys.push_back(b);
            isexist[abs(b)] = true;
        }
        G[abs(a)][abs(b)] = G[abs(b)][abs(a)] = 1;
    }
    int test;
    cin >> test;
    for (int i = 0; i < test; i++) {
        int a, b;
        string s1,s2;
        cin>>s1>>s2;
        a=stoi(s1);
        b=stoi(s2);
        res.clear();
        if (s1.length() == 5&&s2.length() ==4) ouba(a, b);
        else if(s1.length() ==4&&s2.length() == 5)godess(a, b);
        else if(s1.length() == 4&&s2.length() == 4) gay(a,b);
        else
            t(a,b);
    }
}