# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
244909 | NONAME | Rima (COCI17_rima) | C++14 | 373 ms | 150520 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>
#define dbg(x) cerr << #x << " = " << x << "\n"
#define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie()
using namespace std;
using ll = long long;
const int N = 5e5 + 10;
int n, ans = 1;
string s[N];
struct trie {
trie *nxt[26];
int cnt, res;
trie() {
for (int i = 0; i < 26; ++i)
nxt[i] = 0;
cnt = 0;
res = 0;
}
void add(string &t, int p = 0) {
if (p == int(t.size())) {
++cnt;
return;
}
int j = t[p] - 'a';
if (nxt[j] == 0)
nxt[j] = new trie();
nxt[j] -> add(t, p + 1);
}
void f(int x) {
for (int i = 0; i < 26; ++i)
if (nxt[i] != 0)
nxt[i] -> f(i);
for (int i = 0; i < 26; ++i)
if (nxt[i] != 0)
res += (nxt[i] -> res);
//cerr << char(x + 'a') << " " << cnt << " " << res << "\n";
ans = max(ans, res);
if (!cnt) res = 0;
else res += cnt;
}
} tr;
int main() {
fast_io;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s[i];
reverse(s[i].begin(), s[i].end());
tr.add(s[i]);
}
tr.f(-1);
cout << ans << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |