#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1LL<<36;
const int M = 3e6;
int pw[M];
signed main()
{
ios::sync_with_stdio(0);
cin.tie(NULL),cout.tie(NULL);
vector<int> hashes={256,149,369,(int)1e6+1,7369,8369};
srand(time(NULL));
int h=hashes[rand()%6];
pw[0]=1;
for (int i=1;i<M;i++)
pw[i]=pw[i-1]*h%mod;
int n;
cin>>n;
map<int,vector<string>> mp;
for (int i=0;i<n;i++)
{
string s;
cin>>s;
mp[s.size()].push_back(s);
}
vector<string> v;
for (auto i:mp)
for (auto j:i.second)
v.push_back(j);
reverse(v.begin(),v.end());
map<int,int> ans;
while (!v.empty())
{
string s=v.back();
v.pop_back();
int hs=0,m=s.size();
for (int i=1;i<m;i++)
hs=hs*h+s[i],hs%=mod;
int mx;
if (ans.find(hs)!=ans.end())
mx=ans[hs]+1;
else
mx=1;
vector<int> wht;
int p;
for (int c='a';c<='z';c++)
{
p=hs;
p+=pw[m-1]*c%mod;
if (ans.find(p)!=ans.end())
mx=max(mx,ans[p]+1),wht.push_back(p);
else if(c==s[0])
wht.push_back(p);
}
for (int i:wht)
ans[i]=mx;
}
int res=0;
for (auto i:ans)
res=max(res,i.second);
cout<<res<<endl;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
17 ms |
23900 KB |
Output isn't correct |
| 2 |
Incorrect |
17 ms |
23896 KB |
Output isn't correct |
| 3 |
Incorrect |
16 ms |
23900 KB |
Output isn't correct |
| 4 |
Execution timed out |
1098 ms |
81428 KB |
Time limit exceeded |
| 5 |
Incorrect |
36 ms |
32852 KB |
Output isn't correct |
| 6 |
Incorrect |
23 ms |
26556 KB |
Output isn't correct |
| 7 |
Incorrect |
25 ms |
26196 KB |
Output isn't correct |
| 8 |
Incorrect |
20 ms |
25776 KB |
Output isn't correct |
| 9 |
Incorrect |
40 ms |
34952 KB |
Output isn't correct |
| 10 |
Incorrect |
22 ms |
25900 KB |
Output isn't correct |
