# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1063699 | 2024-08-17T23:44:08 Z | dyogorb | Type Printer (IOI08_printer) | C++14 | 52 ms | 10956 KB |
#include <bits/stdc++.h> using namespace std; const int WMAX = 5e4; int trie[WMAX][26]; int node_count; bool stop[WMAX]; string biggest; string ans; void insert(string word){ int node = 0; for (int i = 0; i < word.size(); i++) { char c = word[i]; if(trie[node][c - 'a'] == 0) trie[node][c - 'a'] = ++node_count; node = trie[node][c - 'a']; } stop[node] = true; } void dfs(int node, int depth, int flag){ if(stop[node]) ans += 'P'; for (int i = 0; i < 26; i++) { if((i != biggest[depth] - 'a' || !flag) && trie[node][i]){ char c = 'a' + i; ans += c; dfs(trie[node][i], depth + 1, 0); ans += '-'; } } if(depth < biggest.size() && trie[node][biggest[depth] - 'a'] && flag){ ans += biggest[depth]; dfs(trie[node][biggest[depth] - 'a'], depth + 1, 1); } } int main(){ int n; cin >> n; string s; biggest = ""; for (int i = 0; i < n; i++) { cin >> s; insert(s); if(s.size() > biggest.size()) biggest = s; } dfs(0, 0, 1); cout << ans.size() << endl; for (auto c : ans) { cout << c << endl; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 428 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 344 KB | Output is correct |
2 | Correct | 8 ms | 604 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 15 ms | 1112 KB | Output is correct |
2 | Correct | 21 ms | 1368 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 52 ms | 3408 KB | Output is correct |
2 | Runtime error | 9 ms | 10840 KB | Execution killed with signal 11 |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 7 ms | 10844 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 8 ms | 10956 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 8 ms | 10844 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |