제출 #721322

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
721322		thimote75	Type Printer (IOI08_printer)	C++14	100 / 100	120 ms	57936 KiB

printer

#include <bits/stdc++.h>

using namespace std;

vector<char> chr_buffer;

struct Trie {
    map<char, Trie*> m;
    int count  = 0;
    int mxSize = 0;

    void append (string &buffer, int offset) {
        if (offset == buffer.size()) { count ++; return ; }

        mxSize = max(mxSize, (int) buffer.size());

        if (m.find(buffer[offset]) == m.end())
            m.insert({ buffer[offset], new Trie() });
        
        Trie* tr = (*m.find(buffer[offset])).second;
        tr->append(buffer, offset + 1);
    }

    void show () {
        for (int i = 0; i < count; i ++)
            chr_buffer.push_back('P');

        bool found = false;
        for (auto u : m) {
            if (u.second->mxSize == mxSize && !found) {
                found = true;
                continue ;
            }
            chr_buffer.push_back(u.first);
            u.second->show();
            chr_buffer.push_back('-');
        }

        for (auto u : m) {
            if (u.second->mxSize != mxSize) continue ;

            chr_buffer.push_back(u.first);
            u.second->show();
            chr_buffer.push_back('-');
            break;
        }
    }
};

Trie res;

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int N;
    cin >> N;

    string b;
    for (int i = 0; i < N; i ++) {
        cin >> b;
        res.append(b, 0);
    }

    res.show();

    while (chr_buffer[chr_buffer.size() - 1] == '-')
        chr_buffer.pop_back();
    
    cout << chr_buffer.size() << '\n';
    for (char c : chr_buffer)
        cout << c << '\n';
}

컴파일 시 표준 에러 (stderr) 메시지

printer.cpp: In member function 'void Trie::append(std::string&, int)':
printer.cpp:14:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |         if (offset == buffer.size()) { count ++; return ; }
      |             ~~~~~~~^~~~~~~~~~~~~~~~

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