2023 广东省赛 E. New but Nostalgic Problem

Capps

已于 2023-10-04 10:24:12 修改

阅读量403

点赞数 3

文章标签：算法 c++ 深度优先

于 2023-05-21 01:44:47 首次发布

本文链接：https://blog.csdn.net/Capps/article/details/130788177

版权

文章介绍了一种在Codeforces平台上遇到的问题，涉及使用字典树（Trie）数据结构来解决字符串集合中的查询。代码展示了如何插入字符串到字典树中，以及如何遍历树以找到第k个特定位置的字符。在构建和遍历字典树的过程中，文章强调了计算节点结束字符串的数量、子树总和等关键步骤。

摘要由CSDN通过智能技术生成

Problem - E - Codeforces

题面：

官方题解：

代码（有英文注释）：

char s[N];
int son[N][26], ed[N], sum[N], calc[N];
// ed[i] is the num of string end of node i
// sum[i] is the sum of ed in subtree of i
// des[i] is true if there is a subnode j of i ,and ed[j]>0
// calc[i] is the sum of des[j], j is all i direct son
bool des[N];
int tot, slen;
void insert() {
    // insert to the trie
    int p = 0;
    for (int i = 1; i <= slen; i++) {
        if (!son[p][s[i] - 'a'])
            son[p][s[i] - 'a'] = ++tot;
        p = son[p][s[i] - 'a'];
    }
    ed[p]++;
}
void build(int i) {
    // initial the des,sum,calc
    if (ed[i]) {
        des[i] = true;
        sum[i] = ed[i];
    }
    for (int j : son[i]) {
        if (j) {
            build(j);
            des[i] |= des[j];
            sum[i] += sum[j];
            calc[i] += des[j];
        }
    }
}
char ans[N];
// ans string
int anstot, n, k, L, R;
// L is all sum,which node is located left of now
// R is all des and ed ,which node is located right of now
void dfs(int i) {
    if (L + R >= k)
        return;
    // if at begining, the L+R>=k, return
    // int the initial, R is added all des[j],j is direct son of i
    for (int c = 0; c < 26; c++) {
        int j = son[i][c];
        if (j) {
            R -= des[j];
            L += sum[j];
            // j is turn from right node to mid node
            if (L + R >= k) {
                ans[++anstot] = char('a' + c);
                // add ans
                // repeal the change and dfs down
                R += ed[j] + calc[j];
                L -= sum[j];
                dfs(j);
                return;
            }
        }
    }
}
int main() {
    int t_;
    cin >> t_;
    while (t_--) {
        cin >> n >> k;
        for (int i = 1; i <= n; i++) {
            cin >> (s + 1);
            slen = strlen(s + 1);
            insert();
        }
        build(0);
        // build trie and get sum,des,calc
        R = calc[0];
        calc[0] = 0;
        dfs(0);
        // get ans and output ans
        if (!anstot)
            cout << "EMPTY";
        else
            for (int i = 1; i <= anstot; i++)
                cout << ans[i];
        cout << "\n";
        // clear
        for (int i = 0; i <= tot; i++) {
            memset(son[i], 0, sizeof son[i]);
            ed[i] = sum[i] = calc[i] = 0;
            des[i] = false;
        }
        tot = anstot = L = R = 0;
    }
}

本场比赛的全部题解可以参考：2023广东省赛题解（SUA现场讲解）_哔哩哔哩_bilibili