Submission #1003398

#	Time	Username	Problem	Language	Result	Execution time	Memory
1003398		vjudge1	Type Printer (IOI08_printer)	C++17	10 / 100	43 ms	35540 KiB

printer

#include <bits/stdc++.h>
using namespace std;
int n;
const int sz=5e5 + 1;
int trie[sz][26];
int bitis[sz];
vector<int> gt[sz];
vector<char> cvb;
int last=0;
void qur(string s){
    int curr=0;
    for(auto &i : s){
        if(trie[curr][i-'a'])curr = trie[curr][i - 'a'];
        else{
            gt[curr].push_back(i - 'a');
            curr = trie[curr][i - 'a'] = ++last;
        }
    }
    bitis[curr]++;
}

void dfs(int node){
    if(bitis[node]){
        for(int i=0;i<bitis[node];++i)cvb.push_back('P');
    }
    for(auto &i : gt[node]){
        cvb.push_back(i + 'a');
        dfs(trie[node][i]);
    }
    cvb.push_back('-');
}

int main(){
    cin >> n;
    vector<string> sira(n);
    for(auto &i : sira){
        cin >> i;
    }
    sort(sira.begin(),sira.end());
    reverse(sira.begin(),sira.end());
    for(auto &i : sira)qur(i);
    dfs(0);
    while(cvb.back() == '-')cvb.pop_back();
    cout << cvb.size() << '\n';
    for(auto &i : cvb)cout << i << '\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