oj.uz

Submission #1040952

# Submission time Handle Problem Language Result Execution time Memory
1040952 2024-08-01T12:46:12 Z ArthuroWich Type Printer (IOI08_printer) C++17
80 / 100
 350 ms 211300 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long int
int trie[250000][26], le[250000][26], co = 1, en[250000];
vector<char> ans;
void insert(string s) {
    int n = 0;
    for (int i = 0; i < s.length(); i++) { 
        char c = s[i];
        le[n][c-'a'] = max(le[n][c-'a'], (int)s.length()-i);
        if (!trie[n][c-'a']) {
            trie[n][c-'a'] = co;
            co++;
        }
        n = trie[n][c-'a'];
    }
    en[n] = 1;
}
void dfs(int a) {
    if (en[a]) {
        ans.push_back('P');
    }
    vector<pair<int, int>> v;
    for (int i = 0; i < 26; i++) {
        if (trie[a][i]) {
            v.push_back({le[a][i], i});
        }
    }
    sort(v.begin(), v.end());
    for (auto [_, i] : v) {
        ans.push_back((char)(i+'a'));
        dfs(trie[a][i]);
        ans.push_back('-');
    }
}
void solve() {
    int n;
    cin >> n;   
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        insert(s);
    }
    dfs(0);
    while(!ans.empty() && ans.back() == '-') {
        ans.pop_back();
    }
    cout << ans.size() << endl;
    for (char c : ans) {
        cout << c << endl;
    }
}
int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    t = 1;
    while(t--) {
        solve();
    }
}

Compilation message

printer.cpp: In function 'void insert(std::string)':
printer.cpp:8:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for (int i = 0; i < s.length(); i++) {
      |                     ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 7 ms 1884 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3164 KB Output is correct
2 Correct 23 ms 3932 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 10988 KB Output is correct
2 Correct 107 ms 23124 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 27096 KB Output is correct
2 Correct 34 ms 5980 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 350 ms 68044 KB Output is correct
2 Runtime error 104 ms 211300 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 248 ms 52936 KB Output is correct
2 Runtime error 115 ms 211280 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -