Submission #1213564

#	Time	Username	Problem	Language	Result	Execution time	Memory
1213564		leandroioilele	Type Printer (IOI08_printer)	C++20	0 / 100	62 ms	27864 KiB

printer

#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define faster ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define NMAX 25005
#define pb push_back 
#define fi first 
#define se second 
int n;

struct gamb{
    int tam;
    char c;
};

struct node{
    map<char,int>next;
    int id;
    int tam;
    char c;
    node(){
        id=-1;
        next.clear();
        tam=0;
        c=' ';
    }
};

vector<node>v;
string resp;
int espaco=0;

int new_node(){
    v.pb(node());
    return v.size()-1;
}

void dfs(int x){
    for(auto it:v[x].next){
        dfs(v[x].next[it.fi]);
        v[x].tam=max(v[x].tam,v[v[x].next[it.fi]].tam+1);
        
    }
    if(v[x].id==1){
        v[x].tam=1;
    }
}

bool func(gamb a, gamb b){
    return a.tam<b.tam;
}

void solve(int x){
    vector<gamb>g;
    gamb aux2;
    if(x!=0){
        espaco++;
        resp.pb(v[x].c);
        if(v[x].id==1){
        resp.pb('P');
        while(espaco--)resp.pb('-');
        }
    }
    for(auto it:v[x].next){
        aux2.c=it.fi;
        aux2.tam=v[v[x].next[it.fi]].tam;
        g.pb(aux2);
    }
    if(g.size()>1)sort(g.begin(),g.end(),func);
    for(auto it:g){
        solve(v[x].next[it.c]);
    }
}
vector<string>s;

int32_t main(){
    cin>>n;
    int x;
    int inicio=new_node();
    for(int i=0; i<n; i++){
        s.pb("penis");
        cin>>s[i];
    }
    sort(s.begin(),s.end());
    for(int i=0; i<n; i++){
        x=inicio;
        for(auto it:s[i]){
            if(v[x].next.count(it)==0){
                v[x].next[it]=new_node();
            }
            x=v[x].next[it];
            v[x].c=it;
        }
        v[x].id=1;
    }
    dfs(inicio);
    solve(inicio);
    char aooo=resp.back();
    while(aooo=='-'){
        resp.pop_back();
        aooo=resp.back();
    }
    cout<<resp.size()<<"\n";
    for(auto it:resp)cout<<it<<"\n";
}

• Subtask 1: 0 / 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