oj.uz

Submission #520077

# Submission time Handle Problem Language Result Execution time Memory
520077 2022-01-28T09:49:23 Z HaYoungJoon Type Printer (IOI08_printer) C++14
80 / 100
 27 ms 31924 KB 
#include <bits/stdc++.h>

using namespace std;

int cost[100001], trie[100001][26],timer = 0;
int n;
vector<int> adj[100001];
bool mark[100001], special[100001];
char label[100001];
vector<char> res;

void addString(string s) {
    int cur = 0;
    for (char c: s) {
        int val = c - 'a';
        if (!trie[cur][val]) {
            trie[cur][val] = ++timer;
            adj[cur].emplace_back(timer);
            label[timer] = c;
        }
        cur = trie[cur][val];
    }
    special[cur] = 1;
}

void markLongest(string s) {
    int cur = 0;
    for (char c: s) {
        int val = c - 'a';
        mark[trie[cur][val]] = 1;
        cur = trie[cur][val];
    }
    mark[cur] = 1;
}


void DFS(int u) {
    int cnt = 0;
    if (special[u]) {
        res.emplace_back('P');
        n--;
    }
    for (int v: adj[u]) {
        if (mark[v]) continue;
        cnt++;
        res.emplace_back(label[v]);
        DFS(v);
    }
    for (int v: adj[u]) {
        if (!mark[v]) continue;
        cnt++;
        res.emplace_back(label[v]);
        DFS(v);
    }
    if (n) res.emplace_back('-');
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    string s, longest;
    for (int i = 1; i <= n; i++) {
        cin >> s;
        addString(s);
        if (longest.size() < s.size()) longest = s;
    }
    markLongest(longest);
    DFS(0);
    cout << res.size() << '\n';
    for (char c: res) cout << c << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3532 KB Output is correct
2 Correct 3 ms 3788 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6092 KB Output is correct
2 Correct 15 ms 10232 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 11464 KB Output is correct
2 Correct 7 ms 4684 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 26 ms 31924 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 27 ms 31524 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -