ACdream 1728 SJY's First Task

简单题。

先建树，我用邻接表来存了。然后对于每个叶子结点DFS一下，DFS深度超过了K就return，找到了叶子节点就记录下来，最后排个序，然后输出答案。

由于结点编号比较奇葩，所以用两个map来转换一下。这个代码写的很丑，大半夜写的，迷迷糊糊。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include<string>
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;

char s[];
map<int, int>zh;
map<int, int>ff;
vector<int>ljb[];
int flag[], rr[];
int ls, K, ye;
int u[], k[];
struct ANS
{
    int A, B, C;
}ans[ + ];
int gh = ;

bool cmp(const ANS&a, const ANS&b)
{
    if (a.A == b.A&&a.B == b.B) return a.C<b.C;
    if (a.A == b.A) return ff[a.B]<ff[b.B];
    return ff[a.A]<ff[b.A];
}
void DFS(int now, int b)
{
    if (b>K) return;
    int i;
    if (flag[now] ==  && now != ye)
    {
        ans[gh].A = ye;
        ans[gh].B = now;
        ans[gh].C = b;
        gh++;
        return;
    }
    for (i = ; i<ljb[now].size(); i++)
    {
        if (rr[ljb[now][i]] == )
        {
            rr[ljb[now][i]] = ;
            DFS(ljb[now][i], b + );
        }
    }

}
int main()
{
    int n, i, j, o;
    while (~scanf("%d", &K))
    {
        scanf("%d", &n);
        zh.clear(); ff.clear();
        memset(flag, , sizeof(flag));
        int p = , tot; gh = ;
        zh[] = p;
        ff[p] = ;
        p++;
        for (i = ; i<; i++) ljb[i].clear();
        for (o = ; o<n; o++)
        {
            scanf("%d %s", &k[o], s);
            ls = ;
            if (zh[k[o]] == ) zh[k[o]] = p, ff[p] = k[o], p++;
            flag[zh[k[o]]] = ;
            int len = strlen(s);
            j = ; tot = ;
            for (i = ; i <= len; i++)
            {
                if (s[i] == ',' || s[i] == '\0')
                {
                    if (zh[ls] == ) zh[ls] = p,ff[p] = ls,p++;
                    u[tot] = zh[ls], tot++, ls = ;
                }
                else ls = ls *  + s[i] - '';
            }
            ljb[].push_back(u[]);
            ljb[u[]].push_back();
            for (i = ; i<tot; i++)
            {
                ljb[u[i - ]].push_back(u[i]);
                ljb[u[i]].push_back(u[i - ]);
            }
            ljb[u[tot - ]].push_back(zh[k[o]]);
            ljb[zh[k[o]]].push_back(u[tot - ]);
        }
        for (i = ; i<n; i++)
        {
            ye = zh[k[i]];
            memset(rr, , sizeof(rr));
            rr[ye] = ;
            DFS(ye, );
        }
        sort(ans, ans + gh, cmp);
        for (i = ; i<gh; i++)
        {
            cout << ff[ans[i].A];
            cout << " ";
            cout << ff[ans[i].B];
            cout << " ";
            cout << ans[i].C;
            cout << endl;
        }
    }
    return ;
}