P4407 电子字典 题解
恶评,最多蓝。
Description
给出
n
n
n 个字符串和
m
m
m 个询问,每个询问由一个字符串
s
i
s_i
si 组成。
问与
s
i
s_i
si 编辑距离为
1
1
1 的字符串个数。
s s s 到 t t t 的编辑距离定义如下:
s s s 需要的最少如下操作到达 t t t:
- 在任意处插入一个字符;
- 在任意处删除一个字符;
- 在任意处改变一个字符。
Idea
Trie 树上 BFS。
在以下的描述中,三元组
(
i
,
j
,
k
)
(i,j,k)
(i,j,k) 表示编辑距离为
i
i
i 时,扫描到第
j
j
j 个字符处,Trie 树的第
k
k
k 个节点。
- 对于每个 直接加入 操作, ( i , j , k ) → ( i , j + 1 , Trie k , i ) (i,j,k)\to(i,j+1,\texttt{Trie}_{k, i}) (i,j,k)→(i,j+1,Triek,i);
- 对于每个 插入 操作, ( i , j , k ) → ( i + 1 , j + 1 , Trie k , l ) (i,j,k)\to(i+1,j+1,\texttt{Trie}_{k,l}) (i,j,k)→(i+1,j+1,Triek,l),其中 l l l 代表要插入的字符;
- 对于每个 删除 操作, ( i , j , k ) → ( i + 1 , j + 1 , k ) (i,j,k)\to(i+1,j+1,k) (i,j,k)→(i+1,j+1,k);
- 对于每个 改变 操作, ( i , j , k ) → ( i , j + 1 , Trie k , l ) (i,j,k)\to(i,j+1,\texttt{Trie}_{k,l}) (i,j,k)→(i,j+1,Triek,l),其中 l l l 代表改变后的字符,其中 l ≠ s i l\ne s_i l=si。
然后直接搜索。
Solution
#include <bits/stdc++.h>
#define int long long
// FOR templates.
#define rep(i, s, n, k) for(int i = s;i <= n;i += k)
#define repn(i, s, n, k) for(int i = s;i < n;i += k)
#define pre(i, s, n, k) for(int i = s;i >= n;i -= k)
#define pren(i, s, n, k) for(int i = s;i > n;i -= k)
// Abbr for STL.
#define pii pair<int, int>
#define pdd pair<double, double>
#define mpi map<int, int>
#define vc vector<int>
// IO templates, proven very useful.
#define cn(n) int n;cin >> n
#define cm(n) cin >> n
#define debug if(isdebug)cout
// Abbr for funcs.
#define pb push_back
#define mset memset
#define multitst() cn(t);while(t--)
// #define files
using namespace std;
const int MAXN = 0x3f3f3f3f3f3f3f3fLL;
const int MOD1 = 1000000007LL;
const int MOD2 = 998244353LL;
const int isdebug = 0LL;
int d[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int gcd(int a, int b) {if(b == 0) return a;return gcd(b, a % b);}
inline int lowbit(int x) {return x & (-x);}
inline int lcm(int a, int b) {return a * b / gcd(a, b);}
int trie[300001][27], ed[300001], tot = 1;
void add(string s){
int p = 1;
repn(i, 0, s.length(), 1){
if(!trie[p][s[i] - 'a'])
trie[p][s[i] - 'a'] = ++tot;
p = trie[p][s[i] - 'a'];
}
ed[p] = 1;
}
int bfs(string s){
queue<pair<int, pii> > q;
map<pair<int, pii>, int> mp; mpi mp1;
q.push(make_pair(0, make_pair(0, 1))); int ans = 0;
while(!q.empty()){
int x = q.front().first;
int y = q.front().second.first;
int z = q.front().second.second;
q.pop();
if(mp[make_pair(x, make_pair(y, z))])
continue;
mp[make_pair(x, make_pair(y, z))] = 1;
if(y == s.length() && ed[z] && x == 0)
return -1;
if(y == s.length() && ed[z] && !mp1[z])
ans++, mp1[z] = 1;
// accept.
if(y < s.length() && trie[z][s[y] - 'a']){
q.push(make_pair(x, make_pair(y + 1, trie[z][s[y] - 'a'])));
}
// skip.
if(y < s.length() && x == 0){
q.push(make_pair(x + 1, make_pair(y + 1, z)));
}
// insert.
repn(i, 0, 26, 1){
if(trie[z][i] && x == 0){
q.push(make_pair(x + 1, make_pair(y, trie[z][i])));
}
}
// change.
repn(i, 0, 26, 1){
if(y < s.length() && i != s[y] - 'a' && trie[z][i] && x == 0){
q.push(make_pair(x + 1, make_pair(y + 1, trie[z][i])));
}
}
}
return ans;
}
signed main(){
#ifdef files
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cn(n); cn(m);
repn(i, 0, n, 1){
string t; cm(t); add(t);
}
repn(i, 0, m, 1){
string t; cm(t); cout << bfs(t) << endl;
}
#ifdef files
fclose(stdin); fclose(stdout);
#endif
return 0;
}
/*
* things to check
* 1. int overflow or long long memory need
* 2. recursion/array/binary search/dp/loop bounds
* 3. precision
* 4. special cases(n=1,bounds)
* 5. delete debug statements
* 6. initialize(especially multi-tests)
* 7. = or == , n or m ,++ or -- , i or j , > or >= , < or <=
* 8. keep it simple and stupid
* 9. do not delete, use // instead
* 10. operator priority
* 11. is there anything extra to output?
* 12. THINK TWICE CODE ONCE, THINK ONCE DEBUG FOREVER
* 13. submit ONCE, AC once. submit twice, WA forever
* 14. calm down and you'll get good rank
* 15. even a bit wrong scores zero
* 16. ...
**/
/*
* something to think about
* 1. greedy? dp? searching? dp with matrix/ segment tree? binary search? ...?
* 2. If it is difficult, why not the opposite?
**/