제출 #799410

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
799410		yeediot	Type Printer (IOI08_printer)	C++17	100 / 100	160 ms	68544 KiB

printer

#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
const int mxn=25005;
const int ascii=26;
int t[mxn*ascii][ascii];
int nxt=1;
vector<string>s;
vector<char>op;
unordered_map<int,bool>mp;
int d[mxn*ascii];
void add(string s){
    int i=0,v=0;
    while(i<sz(s)){
        d[v]=max(d[v],sz(s)-i);
        if(t[v][s[i]-'a']){
            v=t[v][s[i++]-'a'];
        }
        else{
            v=t[v][s[i++]-'a']=nxt++;
        }
    }
    mp[v]=1;
}
int ans=0;
void dfs(int v){
    vp ord;
    if(mp[v]){
        op.pb('P');
        ans++;
    }
    for(int i=0;i<26;i++){
        if(t[v][i]){
            ord.pb({d[t[v][i]],i});
        }
    }
    sort(all(ord));
    for(int i=0;i<sz(ord);i++){
        op.pb(ord[i].S+'a');
        ans++;
        dfs(t[v][ord[i].S]);
        op.pb('-');
        ans++;
    }
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        string temp;
        cin>>temp;
        add(temp);
    }
    dfs(0);
    while(op.back()=='-'){
        op.pop_back();
        ans--;
    }
    cout<<ans<<'\n';
    for(auto i:op)cout<<i<<'\n';
    
}
 /*
 input:
 
 */
 

• 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