RT:
待封装:
#include<bits/stdc++.h>
#include<bits/extc++.h>
using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << "s" << endl;
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
int nxt()
{
int ret;
scanf("%d", &ret);
return ret;
}
const int maxn = 1e6 + 500;
string s[160];
int root, cnt;
struct node {
int end;
int vis[26];
int fail;
}T[maxn];
struct restlt {
int pos, num;
bool operator <(const restlt& a)const {
return num != a.num? num > a.num : pos < a.pos;
}
}ans[160];
void init(int o) {
met(T[o].vis, 0);
T[o].end = T[o].fail = 0;
}
void build(string& cur, int th) {
int now = 0;
for (auto i : cur) {
if (!T[now].vis[i - 'a']) {
T[now].vis[i - 'a'] = ++cnt;
init(cnt);
}
now = T[now].vis[i - 'a'];
}
T[now].end = th;
}
void get_fail() {
queue<int> q;
_for(i, 0, 26) {
int& sec_layer = T[0].vis[i];
if (sec_layer) {
T[sec_layer].fail = 0;
q.push(sec_layer);
}
}
while (!q.empty())
{
int cur = q.front();
q.pop();
_for(i, 0, 26) {
if (T[cur].vis[i]) {
T[T[cur].vis[i]].fail = T[T[cur].fail].vis[i];
q.push(T[cur].vis[i]);
}
else T[cur].vis[i] = T[T[cur].fail].vis[i];
}
}
}