oj.uz

Submission #1065035

# Submission time Handle Problem Language Result Execution time Memory
1065035 2024-08-18T21:30:24 Z YassirSalama Type Printer (IOI08_printer) C++17
100 / 100
 933 ms 99396 KB 
#include<bits/stdc++.h>
using namespace std;
struct Node{
    Node* c[26];
    int maxdepth=0;
    bool leaf=false;
    Node(){
        for(int i=0;i<26;i++) c[i]=nullptr;
    }
};
Node* root=new Node();
void insert(string s){
    Node* node=root;
    int n=s.length();
    for(int i=0;i<n;i++){
        if(node->c[s[i]-'a']==nullptr) node->c[s[i]-'a']=new Node();
        node=node->c[s[i]-'a'];
        node->maxdepth=max(node->maxdepth,n);
    }
    node->leaf=true;
}
int k;
vector<char> op;
void dfs(Node* node){
    int best=-1;
    int mx=-1;
    for(int i=0;i<26;i++){
        if(node->c[i]!=nullptr){
            if(node->c[i]->maxdepth>mx){
                mx=node->c[i]->maxdepth;
                best=i;
            }
        }
    }
    if(node->leaf){
        k--;
        op.push_back('P');
    }
    for(int j=0;j<26;j++){
        if(node->c[j]){
            if(j==best) continue;
            op.push_back(char('a'+j));
            dfs(node->c[j]);
            if(k!=0)
                op.push_back('-');
        }
    }
    if(best!=-1){
        op.push_back(char(best+'a'));
        dfs(node->c[best]);
        if(k!=0) op.push_back('-');
    }
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    k=n;
    string s;
    for(int i=0;i<n;i++){
        cin>>s;
        insert(s);
    }
    dfs(root);
    cout<<op.size()<<endl;
    for(auto x:op){
        cout<<x<<endl;
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 8 ms 1116 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1884 KB Output is correct
2 Correct 18 ms 2396 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 5980 KB Output is correct
2 Correct 119 ms 12520 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 14800 KB Output is correct
2 Correct 39 ms 3164 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 36552 KB Output is correct
2 Correct 778 ms 83400 KB Output is correct
3 Correct 404 ms 42696 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 284 ms 28620 KB Output is correct
2 Correct 933 ms 99396 KB Output is correct
3 Correct 491 ms 48588 KB Output is correct
4 Correct 874 ms 93640 KB Output is correct