# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1063695 | 2024-08-17T23:36:31 Z | dyogorb | Type Printer (IOI08_printer) | C++14 | 67 ms | 6748 KB |
#include <bits/stdc++.h> using namespace std; const int WMAX = 3e4; int trie[WMAX][26]; int node_count; bool stop[WMAX]; string biggest; string ans; void insert(string word){ int node = 0; for (char c: word) { 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){ for (int i = 0; i < 26; i++) { if((i != biggest[depth] - 'a' || !flag) && trie[node][i]){ char c = 'a' + i; ans += c; if(stop[trie[node][i]]) ans += 'P'; dfs(trie[node][i], depth + 1, 0); ans += '-'; } } if(depth < biggest.size() && trie[node][biggest[depth] - 'a'] && flag){ ans += biggest[depth]; if(depth == biggest.size() - 1) ans += 'P'; 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 | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | didn't print every word |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | didn't print every word |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 348 KB | didn't print every word |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 20 ms | 1368 KB | didn't print every word |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 67 ms | 3180 KB | didn't print every word |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 6748 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 6748 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 6748 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |