Submission #1178904

#	Time	Username	Problem	Language	Result	Execution time	Memory
1178904		sasde	Type Printer (IOI08_printer)	C++20	Compilation error	0 ms	0 KiB

printer

#include <bits/stdc++.h>
#define emb emplace_back
using namespace std;

const int MAXN = 25001 // Số lượng node tối đa, cần đủ lớn
struct Trie {
    int child[26]; // Chỉ số tới các nút con
    int cnt = 0;    // Số lần kết thúc từ tại đây
    int h = 0;      // Độ sâu lớn nhất từ node này
} tr[MAXN];

int node_cnt = 1; // Node gốc là node 0

void add(int root, const string &s) {
    int cur = root;
    for (char x : s) {
        int c = x - 'a';
        if (tr[cur].child[c] == 0) {
            tr[cur].child[c] = node_cnt++;
        }
        cur = tr[cur].child[c];
    }
    tr[cur].cnt++;
}

vector<char> res;

void query1(int root) {
    while (tr[root].cnt--) {
        res.emb('P');
    }
    int u = -1, v = -1;
    for (int i = 0; i < 26; ++i) {
        if (tr[root].child[i] == 0) continue;
        if (tr[tr[root].child[i]].h > u) {
            u = tr[tr[root].child[i]].h;
            v = i;
        }
    }
    for (int i = 0; i < 26; ++i) {
        if (tr[root].child[i] == 0 || i == v) continue;
        res.emb('a' + i);
        query1(tr[root].child[i]);
        res.emb('-');
    }
    if (v != -1) {
        res.emb('a' + v);
        query1(tr[root].child[v]);
        res.emb('-');
    }
}

void query(int root, int u) {
    tr[root].h = max(tr[root].h, u);
    for (int i = 0; i < 26; ++i) {
        if (tr[root].child[i] == 0) continue;
        query(tr[root].child[i], u + 1);
        tr[root].h = max(tr[root].h, tr[tr[root].child[i]].h);
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int n;
    string s;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> s;
        add(0, s); // Root là node 0
    }

    query(0, 0);
    query1(0);
    while (!res.empty() && res.back() == '-') res.pop_back();

    cout << res.size() << '\n';
    for (char x : res) cout << x << '\n';

    return 0;
}

Compilation message (stderr)

printer.cpp:6:1: error: expected ',' or ';' before 'struct'
    6 | struct Trie {
      | ^~~~~~
printer.cpp:10:3: error: 'tr' does not name a type; did you mean 'tm'?
   10 | } tr[MAXN];
      |   ^~
      |   tm
printer.cpp: In function 'void add(int, const string&)':
printer.cpp:18:13: error: 'tr' was not declared in this scope; did you mean 'tm'?
   18 |         if (tr[cur].child[c] == 0) {
      |             ^~
      |             tm
printer.cpp:21:15: error: 'tr' was not declared in this scope; did you mean 'tm'?
   21 |         cur = tr[cur].child[c];
      |               ^~
      |               tm
printer.cpp:23:5: error: 'tr' was not declared in this scope; did you mean 'tm'?
   23 |     tr[cur].cnt++;
      |     ^~
      |     tm
printer.cpp: In function 'void query1(int)':
printer.cpp:29:12: error: 'tr' was not declared in this scope; did you mean 'tm'?
   29 |     while (tr[root].cnt--) {
      |            ^~
      |            tm
printer.cpp:34:13: error: 'tr' was not declared in this scope; did you mean 'tm'?
   34 |         if (tr[root].child[i] == 0) continue;
      |             ^~
      |             tm
printer.cpp:35:13: error: 'tr' was not declared in this scope; did you mean 'tm'?
   35 |         if (tr[tr[root].child[i]].h > u) {
      |             ^~
      |             tm
printer.cpp:41:13: error: 'tr' was not declared in this scope; did you mean 'tm'?
   41 |         if (tr[root].child[i] == 0 || i == v) continue;
      |             ^~
      |             tm
printer.cpp:43:16: error: 'tr' was not declared in this scope; did you mean 'tm'?
   43 |         query1(tr[root].child[i]);
      |                ^~
      |                tm
printer.cpp:48:16: error: 'tr' was not declared in this scope; did you mean 'tm'?
   48 |         query1(tr[root].child[v]);
      |                ^~
      |                tm
printer.cpp: In function 'void query(int, int)':
printer.cpp:54:5: error: 'tr' was not declared in this scope; did you mean 'tm'?
   54 |     tr[root].h = max(tr[root].h, u);
      |     ^~
      |     tm