PAT-A 1139 First Contact（30 分）

最新推荐文章于 2021-08-25 20:18:30 发布

ShadowFox_

最新推荐文章于 2021-08-25 20:18:30 发布

阅读量382

点赞数

分类专栏： PAT甲级文章标签： PAT C

本文链接：https://blog.csdn.net/ShadowFox_/article/details/81950229

版权

PAT甲级专栏收录该内容

25 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <cstdio>
#include <map>
#include <set>
using namespace std;
#define MAXN 301

struct Close{
    vector<int> same;
};
struct Res{
    string n1,n2;
};

bool cmp(const Res &a,const Res &b){
    if(a.n1==b.n1){
        return a.n2<b.n2;
    }
    return a.n1<b.n1;
}
int main()
{
    int n,m;
    int men=0;
    map<string,int> name;
    vector<string> number;
    Close close[MAXN];
    int board[MAXN][MAXN];
    memset(board,0,sizeof(board));
    scanf("%d%d",&n,&m);
    char n1[6],n2[6];
    string n1s,n2s;
    for(int i=0;i<m;i++){
        getchar();
        scanf("%s %s",n1,n2);
        n1s=n1,n2s=n2;
        if(name.count(n1s)==0){
            number.push_back(n1s);
            name[n1s]=men;
            men++;
        }
        if(name.count(n2s)==0){
            number.push_back(n2s);
            name[n2s]=men;
            men++;
        }
        board[name[n1s]][name[n2s]]=1;
        board[name[n2s]][name[n1s]]=1;
        if((n1s[0]=='-'&&n2s[0]=='-')||(n1s[0]!='-'&&n2s[0]!='-')){
            close[name[n1s]].same.push_back(name[n2s]);
            close[name[n2s]].same.push_back(name[n1s]);
        }
    }
    int Q;
    scanf("%d",&Q);
    while(Q--){
        vector<Res> res;
        getchar();
        scanf("%s %s",n1,n2);
        n1s=n1,n2s=n2;
        if(!name.count(n1s)||!name.count(n2s)){
            printf("0\n");
            continue;
        }
        for(int i=0; i<close[name[n1s]].same.size(); i++)
        {
            for(int j=0; j<close[name[n2s]].same.size(); j++)
            {
                if(board[close[name[n1s]].same[i]][close[name[n2s]].same[j]]==1&&\
                   number[close[name[n1s]].same[i]]!=n2s&&\
                   number[close[name[n2s]].same[j]]!=n1s)
                {
                    Res t;
                    t.n1=number[close[name[n1s]].same[i]];
                    if(t.n1[0]=='-'){
                        for(int z=1;z<=4;z++) t.n1[z-1]=t.n1[z];
                        t.n1.erase(4);
                    }
                    t.n2=number[close[name[n2s]].same[j]];
                    if(t.n2[0]=='-'){
                        for(int z=1;z<=4;z++) t.n2[z-1]=t.n2[z];
                        t.n2.erase(4);
                    }
                    res.push_back(t);
                }
            }
        }
        sort(res.begin(),res.end(),cmp);
        printf("%d\n",res.size());
        for(int i=0;i<res.size();i++){
            printf("%s %s\n",res[i].n1.data(),res[i].n2.data());
        }
    }
    return 0;
}