oj.uz

Submission #239576

# Submission time Handle Problem Language Result Execution time Memory
239576 2020-06-16T13:02:21 Z Autoratch Type Printer (IOI08_printer) C++14
100 / 100
 182 ms 87152 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1e6;

int n;
string s[N],ans;
int tree[N][26],mxch[N],mxs[N];
int cur[N],cnt;
vector<string> ls;

void add(string s)
{
    int now = 0;
    for(char c : s) 
    {
        if(s.length()>mxs[now]) mxs[now] = s.length(),mxch[now] = c-'a';
        if(tree[now][c-'a']) now = tree[now][c-'a'];
        else tree[now][c-'a'] = ++cnt,now = cnt;
    }
    cur[now]++;
}

void solve(int now,string cu)
{
    while(cur[now]--) ls.push_back(cu);
    for(int i = 0;i < 26;i++) if(tree[now][i])
    {
        if(mxs[now] and mxch[now]==i) continue;
        solve(tree[now][i],cu+(char)(i+'a'));
    }
    if(mxs[now]) solve(tree[now][mxch[now]],cu+(char)(mxch[now]+'a'));
}

void ch(string a,string b)
{
    int sm = 0;
    for(int i = 0,j = 0;i < a.length() and j < b.length() and a[i]==b[j];i++,j++) sm++;
    for(int i = 0;i < a.length()-sm;i++) ans+='-';
    for(int i = sm;i < b.length();i++) ans+=b[i];
    ans+='P';
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n;
    for(int i = 1;i <= n;i++) cin >> s[i],add(s[i]);
    solve(0,"");
    for(int i = 0;i < ls.size();i++)
    {
        string a = "",b = ls[i];
        if(i) a = ls[i-1];
        ch(a,b);
    }
    cout << ans.length() << '\n';
    for(char c : ans) cout << c << '\n';
}

Compilation message

printer.cpp: In function 'void add(std::__cxx11::string)':
printer.cpp:17:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(s.length()>mxs[now]) mxs[now] = s.length(),mxch[now] = c-'a';
            ~~~~~~~~~~^~~~~~~~~
printer.cpp: In function 'void ch(std::__cxx11::string, std::__cxx11::string)':
printer.cpp:38:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0,j = 0;i < a.length() and j < b.length() and a[i]==b[j];i++,j++) sm++;
                         ~~^~~~~~~~~~~~
printer.cpp:38:46: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0,j = 0;i < a.length() and j < b.length() and a[i]==b[j];i++,j++) sm++;
                                            ~~^~~~~~~~~~~~
printer.cpp:39:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i < a.length()-sm;i++) ans+='-';
                   ~~^~~~~~~~~~~~~~~
printer.cpp:40:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = sm;i < b.length();i++) ans+=b[i];
                    ~~^~~~~~~~~~~~
printer.cpp: In function 'int main()':
printer.cpp:51:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i < ls.size();i++)
                   ~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 31616 KB Output is correct
2 Correct 24 ms 31616 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 31616 KB Output is correct
2 Correct 27 ms 31744 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 31744 KB Output is correct
2 Correct 28 ms 31616 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 31744 KB Output is correct
2 Correct 25 ms 31616 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 31744 KB Output is correct
2 Correct 26 ms 32128 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 32580 KB Output is correct
2 Correct 28 ms 32768 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 34944 KB Output is correct
2 Correct 45 ms 38516 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 39932 KB Output is correct
2 Correct 38 ms 33956 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 52204 KB Output is correct
2 Correct 156 ms 78244 KB Output is correct
3 Correct 101 ms 57680 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 47856 KB Output is correct
2 Correct 182 ms 87152 KB Output is correct
3 Correct 111 ms 61040 KB Output is correct
4 Correct 160 ms 84524 KB Output is correct