# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49246 | rzbt | Rima (COCI17_rima) | C++14 | 2 ms | 604 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 mp make_pair
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define MAXN 3000005
typedef long long ll;
using namespace std;
int trie[MAXN][30];
int n;
char s[MAXN];
bool kraj[MAXN];
int cvor=1;
int sz;
int res=0;
int dfs(int t){
//printf(" %d\n",t);
int br=0, mx=0;
for(int i=0;i<30;i++){
if(trie[t][i]){
int tmp=dfs(trie[t][i]);
if(tmp){
br++;
mx=max(mx,tmp);
}
}
}
res=max(res,br+mx-1);
if(kraj[t])return (br?br+mx:1);
return 0;
}
int main()
{
scanf("%d", &n);
for(int i=0;i<n;i++){
scanf("%s",s);
sz=strlen(s);
reverse(s,s+sz);
int tren=0;
for(int j=0;j<sz;j++){
if(trie[tren][s[j]-'a'])
tren=trie[tren][s[j]-'a'];
else{
trie[tren][s[j]-'a']=cvor;
cvor++;
tren=trie[tren][s[j]-'a'];
}
}
kraj[tren]=true;
}
dfs(0);
printf("%d",res);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |