oj.uz

Submission #415988

# Submission time Handle Problem Language Result Execution time Memory
415988 2021-06-01T19:17:10 Z fvogel499 Type Printer (IOI08_printer) C++14
80 / 100
 1000 ms 125892 KB 
/*
File created on 06/01/2021 at 20:53:10.
Link to problem: https://oj.uz/problem/view/IOI08_printer
Description: use a trie structures
Time complexity: O(N)
Space complexity: O(N)
Status: DEV
Copyright: Ⓒ 2021 Francois Vogel
*/

#include <iostream>
#include <cmath>
#include <vector>
#include <bitset>
#include <queue>
#include <cstring>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>

using namespace std;

#define pii pair<int, int>
#define f first
// #define s second

#define pb push_back
#define ins insert
#define cls clear

#define ll long long

vector<char> steps;
int proc;

struct Node {
    Node(char lt, int ld) {
        t = lt;
        d = ld;
        md = d;
        words = 0;
        for (int i = 0; i < 26; i++) exist[i] = nullptr;
    }
    void add(string& s) {
        if (s.empty()) {
            words++;
            return;
        }
        int i = s[s.size()-1]-'a';
        if (exist[i] == nullptr) {
            exist[i] = new Node(char(i)+'a', d+1);
            c.pb(exist[i]);
        }
        s.pop_back();
        exist[i]->add(s);
        md = max(md, exist[i]->md);
    }
    int words, d, md;
    char t;
    Node* exist [26];
    vector<Node*> c;
};

void dfs(Node* i) {
    for (int j = 0; j < i->words; j++) {
        steps.pb('P');
        proc--;
    }
    for (Node* j : i->c) {
        if (j->md == i->md) continue;
        steps.pb(j->t);
        dfs(j);
        if (proc > 0) steps.pb('-');
    }
    for (Node* j : i->c) {
        if (j->md != i->md) continue;
        steps.pb(j->t);
        dfs(j);
        if (proc > 0) steps.pb('-');
    }
}

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

    Node* root = new Node('$', 0);

    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        string ls;
        cin >> ls;
        reverse(ls.begin(), ls.end());
        root->add(ls);
    }

    proc = n;
    dfs(root);

    cout << steps.size() << endl;
    for (char i : steps) cout << i << endl;

    int d = 0;
    d++;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 332 KB Output is correct
2 Correct 18 ms 1228 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 2220 KB Output is correct
2 Correct 33 ms 2744 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 7392 KB Output is correct
2 Correct 198 ms 15840 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 280 ms 18460 KB Output is correct
2 Correct 75 ms 4104 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 607 ms 46256 KB Output is correct
2 Execution timed out 1087 ms 105892 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 478 ms 35872 KB Output is correct
2 Execution timed out 1093 ms 125892 KB Time limit exceeded
3 Halted 0 ms 0 KB -