String/Trie/Trie_array_ver.h

• View this file on GitHub
• Last update: 2025-06-11 15:37:14+07:00

Depends on

• template.h

Code

#include "../../template.h"


struct Node {
    int child[26], isEnd;

    Node() {
        memset(child, 0, sizeof child);
        isEnd = 0;
    }
};

class Trie {
public:
    int n, curVertex;
    vector<Node> tree;

    Trie() {}
    Trie(int _n): n(_n+1), curVertex(0) {
        tree.assign(n+1, Node());
    }

    void add(const string &s) {
        int u = 0;
        for (size_t i = 0; i < s.size(); i++) {
            int k = s[i] - 'a';
            if (!tree[u].child[k]) {
                tree[u].child[k] = ++curVertex;
            }
            u = tree[u].child[k];
        }
        tree[u].isEnd++;
    }

    bool search(const string &s) {
        int u = 0;
        for (size_t i = 0; i < s.size(); i++) {
            int k = s[i] - 'a';
            if (!tree[u].child[k]) {
                return 0;
            }
            u = tree[u].child[k];
        }
        return tree[u].isEnd;
    }

    void del(const string &s) {
        if (!search(s)) return;
        int u = 0;
        for (size_t i = 0; i < s.size(); i++) {
            int k = s[i] - 'a';
            u = tree[u].child[k];
        }
        tree[u].isEnd--;
    }

    // sort string
    void dfs(int pos, string &cur, vector<string> &res) {
        for (int i = 0; i < tree[pos].isEnd; i++) {
            res.push_back(cur);
        }
        for (int i = 0; i < 26; i++) {
            if (!tree[pos].child[i]) continue;
            cur += char(i + 'a');
            dfs(tree[pos].child[i], cur, res);
            cur.pop_back();
        }
    }

    vector<string> sort_string() {
        vecor<int> res;
        string s = "";
        dfs(0, s, res);
        return res;
    }

    string find_kth_string(int k) {
        
    }
};

#line 2 "template.h"

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define MOD (ll)(1e9+7)
#define all(x) (x).begin(),(x).end()
#define unique(x) x.erase(unique(all(x)), x.end())
#define INF32 ((1ull<<31)-1)
#define INF64 ((1ull<<63)-1)
#define inf (ll)1e18

#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

const int mod = 998244353;

void solve();

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // cin.exceptions(cin.failbit);
    // int t; cin >> t;
    // while(t--)
        solve();
    cerr << "\nTime run: " << 1000 * clock() / CLOCKS_PER_SEC << "ms" << '\n';
    return 0;
}
#line 2 "String/Trie/Trie_array_ver.h"


struct Node {
    int child[26], isEnd;

    Node() {
        memset(child, 0, sizeof child);
        isEnd = 0;
    }
};

class Trie {
public:
    int n, curVertex;
    vector<Node> tree;

    Trie() {}
    Trie(int _n): n(_n+1), curVertex(0) {
        tree.assign(n+1, Node());
    }

    void add(const string &s) {
        int u = 0;
        for (size_t i = 0; i < s.size(); i++) {
            int k = s[i] - 'a';
            if (!tree[u].child[k]) {
                tree[u].child[k] = ++curVertex;
            }
            u = tree[u].child[k];
        }
        tree[u].isEnd++;
    }

    bool search(const string &s) {
        int u = 0;
        for (size_t i = 0; i < s.size(); i++) {
            int k = s[i] - 'a';
            if (!tree[u].child[k]) {
                return 0;
            }
            u = tree[u].child[k];
        }
        return tree[u].isEnd;
    }

    void del(const string &s) {
        if (!search(s)) return;
        int u = 0;
        for (size_t i = 0; i < s.size(); i++) {
            int k = s[i] - 'a';
            u = tree[u].child[k];
        }
        tree[u].isEnd--;
    }

    // sort string
    void dfs(int pos, string &cur, vector<string> &res) {
        for (int i = 0; i < tree[pos].isEnd; i++) {
            res.push_back(cur);
        }
        for (int i = 0; i < 26; i++) {
            if (!tree[pos].child[i]) continue;
            cur += char(i + 'a');
            dfs(tree[pos].child[i], cur, res);
            cur.pop_back();
        }
    }

    vector<string> sort_string() {
        vecor<int> res;
        string s = "";
        dfs(0, s, res);
        return res;
    }

    string find_kth_string(int k) {
        
    }
};

Back to top page