# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
474433 | Lam_lai_cuoc_doi | Rima (COCI17_rima) | C++17 | 323 ms | 134744 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;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
template <class T>
void read(T &x)
{
x = 0;
register int c;
while ((c = getchar()) && (c > '9' || c < '0'))
;
for (; c >= '0' && c <= '9'; c = getchar())
x = x * 10 + c - '0';
}
constexpr bool typetest = 0;
constexpr int N = 5e5 + 5;
constexpr int Inf = 1e9 + 7;
struct node
{
node *child[26];
int v;
node()
{
for (int i = 0; i < 26; ++i)
child[i] = NULL;
v = 0;
}
};
struct trie
{
node root;
void Update(const string &s, int v)
{
node *a = &root;
int id(0);
while (1)
{
if (id == (int)s.size())
{
a->v = max(a->v, v);
return;
}
if (!(a->child[s[id] - 'a']))
a->child[s[id] - 'a'] = new node;
a = a->child[s[id] - 'a'];
++id;
}
}
int Get(const string &s)
{
int ans(0), id(0);
node *a = &root;
while (1)
{
if (id >= (int)s.size() - 1)
{
if (id != (int)s.size())
ans = max(ans, a->v);
for (int i = 0; i < 26; ++i)
if ((id != (int)s.size() - 1 || i != s[id] - 'a') && a->child[i])
ans = max(ans, a->child[i]->v);
}
if (id == (int)s.size())
break;
if (!(a->child[s[id] - 'a']))
break;
a = a->child[s[id] - 'a'];
++id;
}
return ans;
}
} f;
int n;
void Read()
{
cin >> n;
}
void Solve()
{
int ans(0);
for (int i = 1; i <= n; ++i)
{
string s;
cin >> s;
reverse(s.begin(), s.end());
int x = f.Get(s) + 1;
ans = max(ans, x);
f.Update(s, x);
}
cout << ans;
}
int32_t main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t(1);
if (typetest)
cin >> t;
for (int _ = 1; _ <= t; ++_)
{
//cout << "Case #" << _ << ": ";
Read();
Solve();
}
//cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |