# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701228 | Do_you_copy | Rima (COCI17_rima) | C++17 | 341 ms | 205132 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 fi first
#define se second
#define pb push_back
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
using ll = long long;
using pii = pair <int, int>;
const int maxN = 3e6 + 10;
const int inf = 0x3f3f3f3f;
int n;
string s[maxN];
struct TNode{
int a[26];
bool ok;
TNode(){
memset(a, 0, sizeof(a));
ok = 0;
}
};
vector <TNode> S(1);
int dp[maxN];
void add(int id, int cur, int pos){
if (pos == signed(s[cur].length())){
S[id].ok = 1;
return;
}
if (!S[id].a[s[cur][pos] - 'a']){
S[id].a[s[cur][pos]- 'a'] = S.size();
S.pb(TNode());
}
add(S[id].a[s[cur][pos] - 'a'], cur, pos + 1);
}
int ans = 0;
void dfs(int u){
pii maxx = {1, 1};
int cnt = S[u].ok;
for (int i = 0; i < 26; ++i){
if (S[u].a[i]){
dfs(S[u].a[i]);
cnt += bool(dp[S[u].a[i]]);
if (maxx.fi < dp[S[u].a[i]]){
swap(maxx.fi, maxx.se);
maxx.fi = dp[S[u].a[i]];
}
else{
maxx.se = max(maxx.se, dp[S[u].a[i]]);
}
}
}
ans = max(ans, maxx.fi + maxx.se + cnt - 2);
if (S[u].ok) dp[u] = maxx.fi + cnt - 1;
}
void Init(){
cin >> n;
for (int i = 1; i <= n; ++i){
cin >> s[i];
reverse(s[i].begin(), s[i].end());
add(0, i, 0);
}
dfs(0);
cout << ans;
}
#define taskname "test"
signed main(){
if (fopen(taskname ".inp", "r")){
freopen(taskname ".inp", "r", stdin);
freopen(taskname ".out", "w", stdout);
}
int tt = 1;
//cin >> tt;
while (tt--){
Init();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |