AOJ ALDS1_7_A 树

来源：互联网发布：淘宝灵魂画师编辑：程序博客网时间：2024/05/22 17:43

给你树的一些信息，要你按要求输出树。

#include <iostream>#include <algorithm>#include <cstdio>#include <list>#include <stack>#include <vector>#include <map>#include <set>#include <cstring>#include <cmath>#include <string>#define N 100005#define INF (1 << 30)typedef long long ll;using namespace std;vector<int> child[N];   //由于子节点个数不确定，vector比较合适int parent[N];int GetDepth(int idx){    int ret = 0;    while (parent[idx] != -1)    {        ++ret;        idx = parent[idx];    }    return ret;}const char *str[3] = { "root", "internal node", "leaf" };int main(){    freopen("in.txt", "r", stdin);    freopen("out.txt", "w", stdout);    int n;    scanf("%d", &n);    fill(parent, parent + n, -1);    int id, k, c;    for (int i = 0; i < n; ++i)    {        scanf("%d %d", &id, &k);        for (int j = 0; j < k; ++j)        {            scanf("%d", &c);            parent[c] = id;            child[id].push_back(c);        }    }    for (int i = 0; i < n; ++i)    {        int depth = GetDepth(i);        int status;        if (depth == 0)            status = 0;        else if (child[i].size())        {            status = 1;            sort(child[i].begin(), child[i].end());        }        else            status = 2;        printf("node %d: parent = %d, depth = %d, %s, ", i, parent[i], depth, str[status]);        printf("[");        for (int j = 0; j < child[i].size(); ++j)        {            if (j)                printf(", ");            printf("%d", child[i][j]);        }        printf("]\n");    }    return 0;}

0 0