Submission #1094630

#	Time	Username	Problem	Language	Result	Execution time	Memory
1094630		Dan4Life	Type Printer (IOI08_printer)	C++17	10 / 100	45 ms	19980 KiB

printer

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
const int mxS = 25000*21;
int n, cnt, dep[mxS];
vector<char> ans;
int trieNode = 0;
int trie[27][mxS];
bitset<mxS> word;

void add(string s){
    int v = 0;
    for(auto u : s){
        int c = u-'a';
        if(!trie[c][v])
            trie[c][v] = ++trieNode;
        v = trie[c][v];
    }
    word[v]=1; dep[s[0]-'c']=max(dep[s[0]-'c'],sz(s));
}

void dfs(int s){
    if(word[s]) ans.pb('P'),cnt++;
    vector<int> ord(26,0); iota(all(ord),0);
    sort(all(ord),[&](int a, int b){
        return dep[a]<dep[b];
    });
    for(int c : ord){
        if(!trie[c][s]) continue;
        ans.pb(char('a'+c));
        dfs(trie[c][s]);
    }
    if(cnt!=n) ans.pb('-');
}

int32_t main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n;
    for(int i = 0; i < n; i++){
        string s; cin >> s; add(s);
    }
    dfs(0); //recur(0);
    cout << sz(ans) << "\n";
    for(auto u : ans) cout << u << "\n";
}

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