ural 1067 && poj 1760 Disk Tree(字典树+模拟)

http://acm.timus.ru/problem.aspx?space=1&num=1067

　　这题是模拟一个目录，我用到字典树来做这题。

　　这题我是用大量stl来减少代码量，不过我对stl的功能并不是完全的熟悉，所以用起来有点别扭，代码时间也大约用了半个多小时，不过最后稳稳的1y了！～

参考代码：

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>

using namespace std;

struct Node;
struct Cata;
typedef vector<Cata> vc;

struct Cata {
    char name[10];
    Node *next;

    bool operator < (const Cata &x) const {
        return strcmp(name, x.name) < 0;
    }
} ;
struct Node {
    vc child;

    Node() {
        child.clear();
    }
} *Root;

void insert(char *p) {
    char tmp[10];
    char *q = tmp;
    Node *cur = Root;
    Cata buf;
    vc::iterator ii;

    while (true) {
        while (*p && *p != '\\') {
            *q = *p;
            q++, p++;
        }
        *q = 0;
//        puts(tmp);

        for (ii = cur->child.begin(); ii != cur->child.end(); ii++) {
            if (!strcmp((*ii).name, tmp)) {
                if (!(*ii).next) {
                    (*ii).next = new Node();
                }
                cur = (*ii).next;
                break;
            }
        }
//        puts("???");
        if (ii == cur->child.end()) {
            buf.next = new Node();
            strcpy(buf.name, tmp);
            cur->child.push_back(buf);
            cur = buf.next;
//            puts("yeah~");
        }

        if (*p) {
            q = tmp;
            p++;
        } else {
            break;
        }
    }
}

void print(int depth, Node *rt) {
    if (!rt) return ;

    vc::iterator ii;

    sort(rt->child.begin(), rt->child.end());
    for (ii = rt->child.begin(); ii != rt->child.end(); ii++) {
        for (int i = 0; i < depth; i++) {
            putchar(' ');
        }
        puts((*ii).name);
        print(depth + 1, (*ii).next);
    }
}

int main() {
    char buf[100];
    int n;

//    freopen("in", "r", stdin);
    while (~scanf("%d", &n)) {
        Root = new Node();
        while (n--) {
            scanf("%s", buf);
            insert(buf);
        }
        print(0, Root);
    }
    return 0;
}

 

——written by Lyon