#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;
const int maxn = 2e6+100;
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[maxn];
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){
hsh[idx].pb(hsh[idx].back()*base+ll(v[idx].second[i]-'A'));
hsh[idx].back() %= mod;
}
revHsh[idx].pb(ll(v[idx].second[n-1]-'A'));
for(int i=n-2;i>=0;--i){
revHsh[idx].pb(revHsh[idx].back()+mul[n-1-i]*ll(v[idx].second[i]-'A'));
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<maxn;++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 |
15892 KB |
Output is correct |
2 |
Incorrect |
19 ms |
15908 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
32 ms |
32416 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
36 ms |
34488 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
20 ms |
17620 KB |
Output is correct |
2 |
Correct |
52 ms |
34764 KB |
Output is correct |
3 |
Incorrect |
63 ms |
35944 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
124 ms |
40532 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
366 ms |
41548 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1089 ms |
18932 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1092 ms |
19892 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
460 ms |
51244 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1070 ms |
31564 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |