oj.uz

Submission #522477

# Submission time Handle Problem Language Result Execution time Memory
522477 2022-02-05T05:03:12 Z Jesus Type Printer (IOI08_printer) C++14
90 / 100
 1000 ms 63748 KB 
#include <bits/stdc++.h>

using namespace std;

vector<char> ans;

struct arbol{
    char letra;
    int palabra_mayor;
    bool fin_palabra=false;
    int hijos[28];
};

int aux,desocupado=1;

arbol raices[500002];

int dfs(int posicion){
    int tam=0;
    for(int i=0;i<28;i++){
        if(raices[posicion].hijos[i]!=0){
            tam=max(dfs(raices[posicion].hijos[i]),tam);
        }
    }
    tam++;
    raices[posicion].palabra_mayor=tam;
    return tam;
}

void res(int pos, bool rama){
    if(pos!=0) {
            ans.push_back(raices[pos].letra);
    }
    if(raices[pos].fin_palabra==true) {
            ans.push_back('P');
    }
    int m=-1;
    for(int i=0;i<28;i++){
        if(raices[pos].hijos[i]!=0){
            if(raices[raices[pos].hijos[i]].palabra_mayor==raices[pos].palabra_mayor-1&&m==-1) m=i;
            else res(raices[pos].hijos[i],false);
        }
    }
    if(pos==0&&m!=-1) res(raices[pos].hijos[m],true);
    else if(m!=-1) res(raices[pos].hijos[m],rama);
    if(pos!=0&&rama==false) {
            ans.push_back('-');
    }
}


int main()
{
    ios_base::sync_with_stdio();cin.tie(0);
    int n;
    cin>>n;
    string palabra;
    for(int i=0;i<n;i++){
        cin>>palabra;
        aux=0;
        for(char l:palabra){
            if(raices[aux].hijos[l-'a']!=0) aux=raices[aux].hijos[l-'a'];
            else{
                raices[aux].hijos[l-'a']=desocupado;
                aux=desocupado;
                raices[aux].letra=l;
                desocupado++;
            }
        }
        raices[aux].fin_palabra=true;
    }
    dfs(0);
    res(0,false);
    cout<<ans.size()<<endl;
    for(char r:ans){
        cout<<r<<endl;
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 60876 KB Output is correct
2 Correct 25 ms 60900 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 60876 KB Output is correct
2 Correct 25 ms 60868 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 60948 KB Output is correct
2 Correct 21 ms 60876 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 60876 KB Output is correct
2 Correct 23 ms 60896 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 60876 KB Output is correct
2 Correct 32 ms 60852 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 60896 KB Output is correct
2 Correct 45 ms 61004 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 61164 KB Output is correct
2 Correct 160 ms 61292 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 61516 KB Output is correct
2 Correct 70 ms 61052 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 424 ms 62112 KB Output is correct
2 Correct 933 ms 63452 KB Output is correct
3 Correct 557 ms 62260 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 355 ms 61868 KB Output is correct
2 Execution timed out 1092 ms 63748 KB Time limit exceeded
3 Halted 0 ms 0 KB -