# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
330408 | Azert | Type Printer (IOI08_printer) | C++14 | 74 ms | 117996 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int nnode;
int trie[N][30];
void add(string a) {
int cur = 0;
for (int i = 0; i < a.size(); i++) {
if (trie[cur][a[i] - 'a'] == -1) {
trie[cur][a[i] - 'a'] = ++nnode;
}
cur = trie[cur][a[i] - 'a'];
}
}
int main() {
int n, m = 0;
scanf("%d", &n);
string tmp;
memset(trie, -1, sizeof(trie));
for (int i = 1; i <= n; i++) {
cin >> tmp;
m = max(m, (int)tmp.size());
add(tmp);
}
// cout << nnode << "\n";
printf("%d\n", 2 * nnode + n - m);
}
Compilation message (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... |