oj.uz

Submission #688648

# Submission time Handle Problem Language Result Execution time Memory
688648 2023-01-27T22:59:59 Z rieyuw Type Printer (IOI08_printer) C++17
100 / 100
 170 ms 71556 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int TOTAL = 25000*20;
 
vector<vector<int>> nxt(TOTAL, vector<int>(26));
vector<int> maxDepth(TOTAL);
vector<bool> isTerminal(TOTAL);
 
string ans = "";
void findMaxDepth(int node, int depth)
{
    maxDepth[node] = depth;
    for (int i = 0; i < 26; ++i)
    {
        if (nxt[node][i] != 0)
        {
            findMaxDepth(nxt[node][i], depth + 1);
            maxDepth[node] = max(maxDepth[node], maxDepth[nxt[node][i]]);
        }
    }
}
 
void dfs(int node)
{
    if (isTerminal[node])
        ans += 'P';
    vector<pair<int,int>> que; que.reserve(26);
    for (int i = 0; i < 26; ++i)
        if (nxt[node][i] != 0)
            que.push_back({maxDepth[nxt[node][i]], i});
    sort(que.begin(), que.end());
    
    for (auto& p : que)
    {
        ans +=(char)('a'+p.second);
        dfs(nxt[node][p.second]);
        ans += '-';
    }
}
 
int main() 
{
    ios::sync_with_stdio(0), cin.tie(0);
    int n; cin >> n;
    int MAXID = 0;
    ans.reserve(3*n);
    while(n--)
    {
        string s; cin >> s;
        int node = 0;
        for (char c : s)
        {
            if (nxt[node][c-'a'] == 0) 
                nxt[node][c-'a'] = ++MAXID;
            node = nxt[node][c-'a'];
        }
        isTerminal[node] = true;
    }
    findMaxDepth(0,0);
    dfs(0);
    while(ans.back() == '-')
        ans.pop_back();
    cout << ans.size() << "\n";
    for (char c : ans)
        cout << c << "\n";
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 68812 KB Output is correct
2 Correct 44 ms 68816 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 68852 KB Output is correct
2 Correct 44 ms 68764 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 68864 KB Output is correct
2 Correct 54 ms 68840 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 68828 KB Output is correct
2 Correct 45 ms 68880 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 68932 KB Output is correct
2 Correct 55 ms 68824 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 68968 KB Output is correct
2 Correct 57 ms 69324 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 69312 KB Output is correct
2 Correct 52 ms 69036 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 69948 KB Output is correct
2 Correct 150 ms 71212 KB Output is correct
3 Correct 104 ms 70048 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 69748 KB Output is correct
2 Correct 170 ms 71556 KB Output is correct
3 Correct 105 ms 70192 KB Output is correct
4 Correct 143 ms 71492 KB Output is correct