oj.uz

Submission #247061

# Submission time Handle Problem Language Result Execution time Memory
247061 2020-07-10T20:47:36 Z ScarletS Type Printer (IOI08_printer) C++17
100 / 100
 185 ms 75180 KB 
#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
using namespace std;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//uniform_int_distribution<int>(1000,10000)(rng)

int nextL[500000+5][26],depths[500000+5],tot=0;
vector<pair<int,int>> children[500000+5];
bool isEnd[500000+5];
string alpha="abcdefghijklmnopqrstuvwxyz",ans="";

void dfs(int cur)
{
    for (int i=0;i<26;++i)
        if (nextL[cur][i])
        {
            dfs(nextL[cur][i]);
            children[cur].push_back({depths[nextL[cur][i]],i});
            depths[cur]=max(depths[cur],depths[nextL[cur][i]]+1);
        }
    sort(children[cur].begin(), children[cur].end());
}

void addWord()
{
    int cur=0;
    string s;
    cin>>s;
    for (auto c : s)
    {
        if (!nextL[cur][c-'a'])
        {
            ++tot;
            nextL[cur][c-'a']=tot;
        }
        cur=nextL[cur][c-'a'];
    }
    isEnd[cur]=1;
}

void ansBuilder(int cur)
{
    if (isEnd[cur])
        ans+='P';
    for (auto i : children[cur])
    {
        ans+=alpha[i.second];
        ansBuilder(nextL[cur][i.second]);
    }
    if (cur)
        ans+="-";
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n;
    cin>>n;
    while (n--)
        addWord();
    dfs(0);
    ansBuilder(0);
    while (sz(ans)&&ans.back()=='-')
        ans.pop_back();
    cout<<sz(ans)<<"\n";
    for (auto c : ans)
        cout<<c<<"\n";
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12160 KB Output is correct
2 Correct 12 ms 12160 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12160 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12160 KB Output is correct
2 Correct 13 ms 12672 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 13056 KB Output is correct
2 Correct 14 ms 13312 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 15744 KB Output is correct
2 Correct 33 ms 19876 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 21256 KB Output is correct
2 Correct 19 ms 14208 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 35092 KB Output is correct
2 Correct 152 ms 65120 KB Output is correct
3 Correct 91 ms 39356 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 29844 KB Output is correct
2 Correct 185 ms 75180 KB Output is correct
3 Correct 98 ms 43028 KB Output is correct
4 Correct 162 ms 71856 KB Output is correct