# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1176476 | lmquan | Type Printer (IOI08_printer) | C++20 | 75 ms | 56060 KiB |
#define taskname ""
#include <iostream>
#include <vector>
#include <cstring>
#include <string>
using namespace std;
const int kNN = 500005;
string result = "", _max = "";
struct Trie {
struct TNode {
int child[26], terminal;
} a[kNN];
int num_node;
Trie() : num_node(0) {
memset(a[num_node].child, -1, sizeof(a[num_node].child));
a[num_node].terminal = 0;
}
void Add(string s) {
int p = 0;
for (char x : s) {
if (a[p].child[x - 'a'] == -1) {
a[p].child[x - 'a'] = ++num_node;
memset(a[num_node].child, -1, sizeof(a[num_node].child));
a[num_node].terminal = 0;
}
p = a[p].child[x - 'a'];
}
a[p].terminal++;
}
void DFS(int d, int node, bool b) {
for (int i = 1; i <= a[node].terminal; i++) {
result += 'P';
}
if (d == _max.size()) {
return ;
}
if (b) {
for (int i = 0; i < 26; i++) {
if (i != (_max[d] - 'a') && (a[node].child[i] != -1)) {
result += char('a' + i);
DFS(d + 1, a[node].child[i], false);
result += '-';
}
}
result += _max[d];
DFS(d + 1, a[node].child[_max[d] - 'a'], true);
} else {
for (int i = 0; i < 26; i++) {
if (a[node].child[i] != -1) {
result += char('a' + i);
DFS(d + 1, a[node].child[i], false);
result += '-';
}
}
}
}
};
int main() {
if (fopen(taskname".inp", "r")) {
freopen(taskname".inp", "r", stdin);
freopen(taskname".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
Trie t;
for (int i = 1; i <= n; i++) {
string s;
cin >> s;
t.Add(s);
if (s.size() > _max.size()) {
_max = s;
}
}
t.DFS(0, 0, true);
cout << result.size() << '\n';
for (auto i : result) {
cout << i << '\n';
}
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |