[BOJ 14725] 개미굴 C++

난이도: Gold 3
번호: 14725
생성일: March 1, 2023 12:48 AM
알고리즘 분류: 문자열, 자료 구조, 트라이, 트리
언어: C++

14725번: 개미굴

C++

#include <iostream>
#include <map>
#include <vector>

using namespace std;

class Trie
{
private:
    map<string, Trie *> child;

public:
    void Insert(vector<string> &foods)
    {
        Trie *now = this;
        for (int i = 0; i < foods.size(); i++)
        {
            if (now->child[foods[i]] == nullptr)
                now->child[foods[i]] = new Trie();
            now = now->child[foods[i]];
        }
    }

    void Output(int depth)
    {
        for (auto &ch : child)
        {
            for (int i = 0; i < depth; i++)
                cout << "--";
            cout << ch.first << '\n';
            ch.second->Output(depth + 1);
        }
    }
};

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);

    int N;
    cin >> N;

    Trie *root = new Trie();
    for (int i = 0; i < N; i++)
    {
        int k;
        cin >> k;
        vector<string> foods(k);
        for (int j = 0; j < k; j++)
            cin >> foods[j];

        root->Insert(foods);
    }

    root->Output(0);
}