Submission #900663

#	Time	Username	Problem	Language	Result	Execution time	Memory
900663		vanea	Type Printer (IOI08_printer)	C++17	100 / 100	81 ms	48588 KiB

printer

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int mxN = 5e5+10;

int trie[mxN][26];
int cnt = 0;
bool stop[mxN], marked[mxN];
string alpha = "abcdefghijklmnopqrstuvwxyz";

void insert(string s) {
    int node = 0;
    for(auto c : s) {
        if(trie[node][c-'a'] == 0) trie[node][c-'a'] = ++cnt;
        node = trie[node][c-'a'];
    }
    stop[node] = true;
}

vector<char> ans;

void mark(string s) {
    int node = 0;
    for(auto c : s) {
        marked[trie[node][c-'a']] = true;
        node = trie[node][c-'a'];
    }
}

void dfs(int node) {
    if(stop[node]) ans.push_back('P');
    vector<pair<int, char>> later;
    for(auto c : alpha) {
        int k = trie[node][c-'a'];
        if(k && marked[k]) later.push_back({k, c});
        else if(k) {
            ans.push_back(c);
            dfs(k);
            ans.push_back('-');
        }
    }
    for(auto it : later) {
        ans.push_back(it.second);
        dfs(it.first);
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    string longest = "";
    for(int i = 0; i < n; i++) {
        string s;
        cin >> s;
        insert(s);
        if(s.length() > longest.length()) longest = s;
    }
    mark(longest);
    dfs(0);
    cout << ans.size() << '\n';
    for(auto it : ans) {
        cout << it << '\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