# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
941940 | 2024-03-09T18:46:37 Z | MuntherCarrot | Type Printer (IOI08_printer) | C++14 | 117 ms | 74124 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define endl '\n' #define all(x) x.begin(), x.end() #define INF 0x3f3f3f3f #define INFLL (ll)0x3f3f3f3f3f3f3f3f const int MOD = 1e9 + 7, SZ = 1e5 + 10; // Trie v0.1 struct trie{ vector<vector<int>> Trie; vector<int> End; vector<char> ans; int MAXN, node_cnt; string big; trie(int N) : MAXN(N), node_cnt(0) { Trie.resize(MAXN, vector<int>(26)); End.resize(MAXN); } void insert(string &word){ int node = 0; for(int i = 0; i < word.size(); i++){ if(Trie[node][word[i] - 'a'] == 0){ Trie[node][word[i] - 'a'] = ++node_cnt; } node = Trie[node][word[i] - 'a']; } End[node]++; } void solve(int node = 0, int x = 0){ for(int i = 0; i < End[node]; i++){ ans.push_back('P'); } for(int i = 0; i < 26; i++){ if(x != -1 && (char)('a' + i) == big[x]) continue; if(Trie[node][i] == 0) continue; ans.push_back((char)('a' + i)); solve(Trie[node][i], -1); ans.push_back('-'); } if(x != -1 && x != big.size()){ ans.push_back(big[x]); solve(Trie[node][big[x] - 'a'], x + 1); } } } Trie(25000 * 20); int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, mx = 0; cin >> n; string s[n]; for(auto &i : s){ cin >> i; Trie.insert(i); if(mx < i.size()){ mx = i.size(); Trie.big = i; } } Trie.solve(); cout << Trie.ans.size() << endl; // cout << Trie.ans.size() - mx << endl; for(int i = 0; i < Trie.ans.size(); i++){ cout << Trie.ans[i] << endl; } return 0; } // by me
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 36 ms | 68688 KB | Output is correct |
2 | Correct | 39 ms | 68688 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 41 ms | 68748 KB | Output is correct |
2 | Correct | 36 ms | 68692 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 36 ms | 68956 KB | Output is correct |
2 | Correct | 37 ms | 68956 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 36 ms | 68692 KB | Output is correct |
2 | Correct | 35 ms | 68952 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 36 ms | 68948 KB | Output is correct |
2 | Correct | 38 ms | 68956 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 39 ms | 69040 KB | Output is correct |
2 | Correct | 37 ms | 68948 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 39 ms | 69200 KB | Output is correct |
2 | Correct | 56 ms | 69716 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 48 ms | 69832 KB | Output is correct |
2 | Correct | 42 ms | 69712 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 72 ms | 71148 KB | Output is correct |
2 | Correct | 101 ms | 73164 KB | Output is correct |
3 | Correct | 73 ms | 72316 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 61 ms | 70856 KB | Output is correct |
2 | Correct | 117 ms | 74124 KB | Output is correct |
3 | Correct | 79 ms | 72812 KB | Output is correct |
4 | Correct | 97 ms | 73916 KB | Output is correct |