# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1061150 | 2024-08-16T06:41:09 Z | belgianbot | Type Printer (IOI08_printer) | C++17 | 28 ms | 28248 KB |
#include <bits/stdc++.h> #define int long long using namespace std; vector<char> ans, letters; vector<vector<pair<int,int>>> adj; void dfs(int curr) { sort(adj[curr].begin(), adj[curr].end()); //if (adj[curr].empty()) ans.push_back('P'); for (auto x : adj[curr]) { ans.push_back(letters[x.second]); dfs(x.second); if (letters[x.second] != 'P') ans.push_back('-'); } } signed main() { ios::sync_with_stdio(false); cin.tie(0); int N; cin >> N; vector<string> words(N); for (int i = 0; i < N; i++) cin >> words[i]; sort(words.begin(), words.end()); int cnt = 1; letters.resize(N * 21 + 1); adj.resize(N * 20 + 1); for (int i = 0; i < N; i++) { int pos = 0; for (int j = 0; j < words[i].length(); j++) { bool exist = false; for (int k = 0; k < adj[pos].size(); k++) { auto x = adj[pos][k]; if (letters[x.second] == words[i][j]) { pos = x.second; exist = true; adj[pos][k].first = max(x.first, (int)(words[i].length()) - j - 1); break; } } if (!exist) { adj[pos].push_back({(int)words[i].length() - j - 1, cnt}); letters[cnt] = words[i][j]; pos = cnt; cnt++; } } adj[pos].push_back({0, cnt}); letters[cnt] = 'P'; cnt++; } dfs(0); int m = ans.size(); for (int i = m-1; ans[i] == '-'; i--) { ans.pop_back(); } m = ans.size(); cout << m << '\n'; for (int i = 0; i < m; i++) cout << ans[i] << '\n'; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 452 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 1628 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 4 ms | 4696 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 14 ms | 7772 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 16 ms | 22620 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 28 ms | 28248 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |