#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define endl '\n'
#define pb push_back
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ii = pair<int,int>;
using iii = tuple<int,int,int>;
const int inf = 2e9+1;
const ll mod = 1e9+7;
const ll base = 101;
template<typename X, typename Y> bool ckmin(X& x, const Y& y) { return (y < x) ? (x=y,1):0; }
template<typename X, typename Y> bool ckmax(X& x, const Y& y) { return (x < y) ? (x=y,1):0; }
bool cmp(pair<int,string>a,pair<int,string>b){
if(a.first==b.first)return 1;
return a.first>b.first;
}
vector<vector<ll>>hsh, revHsh;
vector<pair<int,string>>v;
ll mul[2000001];
void computeHash(int idx){
int n = v[idx].first;
hsh[idx].pb(ll(v[idx].second[0]-'A'));
for(int i=1;i<n;++i){
ll add = hsh[idx].back()*base+ll(v[idx].second[i]-'A');
hsh[idx].pb(add);
hsh[idx].back() %= mod;
}
revHsh[idx].pb(ll(v[idx].second[n-1]-'A'));
for(int i=n-2;i>=0;--i){
ll add = revHsh[idx].back()+mul[n-1-i]*ll(v[idx].second[i]-'A');
revHsh[idx].pb(add);
revHsh[idx].back() %= mod;
}
}
unordered_map<int,int>dp;
int main(){_
int n;cin>>n;
v.resize(n);
for(int i=0;i<n;++i){
cin>>v[i].second;
v[i].first = sz(v[i].second);
}
mul[0] = 1ll;
for(int i=1;i<=2e6;++i)mul[i] = (mul[i-1]*base)%mod;
sort(all(v), cmp);
hsh.resize(n), revHsh.resize(n);
int best = 0;
for(int i=0;i<n;++i){
computeHash(i);
int m = v[i].first;
int me = int(hsh[i][m-1]);
int res = dp[me]+1;
for(int j=0;j<m;++j)
if(hsh[i][j]==revHsh[i][j])ckmax(dp[int(hsh[i][j])], res);
ckmax(best, res);
}
cout<<best<<endl;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
15900 KB |
Output is correct |
2 |
Incorrect |
19 ms |
15984 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
38 ms |
32392 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
39 ms |
34488 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
22 ms |
17556 KB |
Output is correct |
2 |
Correct |
54 ms |
34712 KB |
Output is correct |
3 |
Incorrect |
63 ms |
35912 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
130 ms |
40344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
384 ms |
41556 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1099 ms |
18888 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1098 ms |
19868 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
461 ms |
51216 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1086 ms |
31592 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |