제출 #940117

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
940117		thinknoexit	Type Printer (IOI08_printer)	C++17	100 / 100	97 ms	50700 KiB

printer

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 500500;
int trie[N][26];
bool ch[N];
int mxd[N];
string ans = "";
void dfs_sz(int v) {
    for (int i = 0;i < 26;i++) {
        if (trie[v][i]) {
            dfs_sz(trie[v][i]);
            mxd[v] = max(mxd[v], mxd[trie[v][i]] + 1);
        }
    }
}
void dfs(int v, int keep) {
    if (ch[v]) ans += "P";
    if (keep) {
        int big = -1;
        for (int i = 0;i < 26;i++) {
            if (trie[v][i]) {
                if (mxd[trie[v][i]] == mxd[v] - 1) big = i;
            }
        }
        for (int i = 0;i < 26;i++) {
            if (trie[v][i] && trie[v][i] != trie[v][big]) {
                ans += i + 'a';
                dfs(trie[v][i], 0);
            }
        }
        if (big != -1) {
            ans += big + 'a';
            dfs(trie[v][big], 1);
        }
        return;
    }
    for (int i = 0;i < 26;i++) {
        if (trie[v][i]) {
            ans += i + 'a';
            dfs(trie[v][i], 0);
        }
    }
    ans += "-";
}
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    int idx = 0;
    for (int i = 1;i <= n;i++) {
        string s;
        cin >> s;
        int now = 0;
        for (auto& x : s) {
            if (!trie[now][x - 'a'])
                trie[now][x - 'a'] = ++idx;
            now = trie[now][x - 'a'];
        }
        ch[now] = 1;
    }
    dfs_sz(0);
    dfs(0, 1);
    cout << ans.size() << '\n';
    for (auto& x : ans) cout << x << '\n';
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10