제출 #1122153

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1122153		Luvidi	Type Printer (IOI08_printer)	C++17	100 / 100	145 ms	101640 KiB

printer

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

#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define fs first
#define sc second
#define pb push_back

string ans;

struct Node{
    Node *ch[26];
    bool b=0,m=0;
    void dfs(){
        if(b)ans+='P';
        for(int i=0;i<26;i++)if(ch[i]&&!ch[i]->m){
            ans+='a'+i;
            ch[i]->dfs();
        }
        for(int i=0;i<26;i++)if(ch[i]&&ch[i]->m){
            ans+='a'+i;
            ch[i]->dfs();
        }
        if(!m)ans+='-';
    }
};

void solve() {
    int n;
    cin>>n;
    string a[n];
    for(int i=0;i<n;i++)cin>>a[i];
    pii ln;
    for(int i=0;i<n;i++)ln=max(ln,{a[i].size(),i});
    Node *root=new Node();
    root->m=1;
    for(int i=0;i<n;i++){
        auto curr=root;
        for(char c:a[i]){
            int x=c-'a';
            if(curr->ch[x]==NULL)curr->ch[x]=new Node();
            curr=curr->ch[x];
            if(i==ln.sc)curr->m=1;
        }
        curr->b=1;
    }
    root->dfs();
    cout<<ans.size()<<'\n';
    for(char c:ans)cout<<c<<'\n';
}

int main() {
    #ifdef FPO
        freopen("in","r",stdin);
        freopen("out","w",stdout);
    #endif
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    solve();
}

• 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