Submission #872311

#	Time	Username	Problem	Language	Result	Execution time	Memory
872311		ObadaKh	Type Printer (IOI08_printer)	C++17	0 / 100	59 ms	39268 KiB

printer

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
/*-------------------------*/
#define ll long long
#define ld long double
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define Dracarys ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
template<typename T> using indexed_multiset = tree<T, null_type, greater_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef pair<ll, int> pi;
const int N = 2e5 + 10;
const int infi = 1e9 + 10;
const ll infl = 1e18 + 10;
const int MOD = 1e9 + 7;
const ld eps = 1e-9;

string ScanString() {
    char ch[100000];
    scanf("%s", ch);
    return ch;
}

bool flag;
string mx = "";
vector<char> Ans;
const int CHAR = 26;

struct TrieNode {
    TrieNode *child[CHAR];
    int Cnt, End, mnlen;

    TrieNode() {
        memset(child, 0, sizeof child);
        Cnt = End = 0;
        mnlen = 50;
    }

    void add(int i, string &s) {
        int cur = s[i] - 'a';
        if (child[cur] == 0) child[cur] = new TrieNode();
        child[cur]->Cnt++;
        if (i == s.size() - 1) {
            child[cur]->End++;
            child[cur]->mnlen = s.size();
            return;
        }
        child[cur]->add(i + 1, s);
    }

    void add(string &s) {
        add(0, s);
    }

    void erase(int i, string &s) {
        int cur = s[i] - 'a';
        child[cur]->Cnt--;
        if (i == s.size() - 1) {
            child[cur]->End--;
            return;
        }
        child[cur]->erase(i + 1, s);
        if (!child[cur]->Cnt) {
            delete child[cur];
            child[cur] = 0;
        }
    }

    void erase(string &s) {
        if (!find(s))return;
        erase(0, s);
    }

    bool find(int i, string &s) {
        int cur = s[i] - 'a';
        if (child[cur] == 0)return 0;
        if (i == s.size() - 1) {
            return child[cur]->End > 0;
        }
        return child[cur]->find(i + 1, s);
    }

    bool find(string &s) {
        return find(0, s);
    }

    int CntPrefix(int i, string &s) {
        int cur = s[i] - 'a';
        if (child[cur] == 0)return 0;
        if (i == s.size() - 1) {
            return child[cur]->Cnt;
        }
        return child[cur]->CntPrefix(i + 1, s);
    }

    int CntPrefix(string &s) {
        return CntPrefix(0, s);
    }

    void DfsMin() {
        for (int i = 0; i < 26; i++) {
            if (child[i])
                child[i]->DfsMin(), mnlen = min(mnlen, child[i]->mnlen);
        }
    }

    void Dfs() {
        set<pair<int, int>> st;
        for (int i = 0; i < 26; i++)
            if (child[i])
                st.insert({child[i]->mnlen, i});

        for (auto &it: st) {
            Ans.push_back(char('a' + it.second));
            if (child[it.second]->End)Ans.push_back('P');
            child[it.second]->Dfs();
            Ans.push_back('-');
        }
    }

    void clear() {
        for (int i = 0; i < CHAR; i++)
            if (child[i])
                child[i]->clear(), delete child[i], child[i] = 0;
    }
};

void RunTime(int Tc) {
    int n;
    cin >> n;
    TrieNode *Root = new TrieNode();
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        if (s.size() > mx.size())mx = s;
        Root->add(s);
    }
    Root->DfsMin();
    Root->Dfs();
    while (Ans.back() == '-')Ans.pop_back();
    cout << Ans.size() << endl;
    for (auto &it: Ans)cout << it << ' ';
}

int main() {
    Dracarys
    int T = 1;
    //cin >> T;
    for (int Tc = 1; Tc <= T; Tc++) {
        RunTime(Tc);
    }
    return 0;
}

Compilation message (stderr)

printer.cpp: In member function 'void TrieNode::add(int, std::string&)':
printer.cpp:45:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         if (i == s.size() - 1) {
      |             ~~^~~~~~~~~~~~~~~
printer.cpp: In member function 'void TrieNode::erase(int, std::string&)':
printer.cpp:60:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         if (i == s.size() - 1) {
      |             ~~^~~~~~~~~~~~~~~
printer.cpp: In member function 'bool TrieNode::find(int, std::string&)':
printer.cpp:79:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |         if (i == s.size() - 1) {
      |             ~~^~~~~~~~~~~~~~~
printer.cpp: In member function 'int TrieNode::CntPrefix(int, std::string&)':
printer.cpp:92:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |         if (i == s.size() - 1) {
      |             ~~^~~~~~~~~~~~~~~
printer.cpp: In function 'std::string ScanString()':
printer.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     scanf("%s", ch);
      |     ~~~~~^~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10