zoj 3661 Palindromic Substring(后缀数组)

首先记录每种回文串，然后我用height 数组二分查找统计每种回文串的出现次数,暴力排序求第K小的值

 

#include <utility>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <set>
#include <vector>
#include <cmath>
#include <queue>
#include <bitset>
#include <map>
#include <iterator>
using namespace std;
#define clr(a,v) memset(a,v,sizeof(a))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int INF = 0x7f7f7f7f;
const int maxn = 211111;
const double pi = acos(-1.0);
const double eps = 1e-10;
const int mod = 777777777;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
ll P[maxn];
char s[maxn];
int a[maxn], o[maxn];
int val[30];
int S[maxn], tot;
pair<int, int> res[maxn];
ll tmp[maxn];
struct node {
	int l, m, len;
} f[maxn];
inline ll Mod(ll n) {
	return n < mod ? n : n % mod;
}
struct Range_M_Query {
	int r[20][maxn];
	int n, i, j, k;
	void make(int a[]) {
		for (i = 0; i <= n; ++i)
			r[0][i] = a[i];
		for (i = 0; i < 19; ++i) {
			k = (1 << i);
			for (j = 0; j + k <= n; ++j) {
				r[i + 1][j] = min(r[i][j], r[i][j + k]);
			}
		}
	}
	int query(int L, int R) {
		k = 0, i = L != R, j = R - L;
		while (i * 2 < j)
			i <<= 1, ++k;
		return min(r[k][L], r[k][R - i]);
	}
} RMQ;
struct Suffix_Array {
	int wa[maxn], wb[maxn], wn[maxn], wv[maxn], h[maxn], rank[maxn], sa[maxn];
	int n;
	bool cmp(int r[], int a, int b, int l) {
		return (r[a] == r[b] && r[a + l] == r[b + l]);
	}
	void Calheight(int r[], int n) {
		this->n = n;
		int i, k = 0, j;
		for (i = 1; i <= n; ++i)
			rank[sa[i]] = i;
		for (i = 0; i < n; h[rank[i++]] = k)
			for (k ? k-- : 0, j = sa[rank[i] - 1]; r[i + k] == r[j + k]; ++k)
				;
	}
	void Da(int r[], int n, int m) {
		int i, j, p, *t, *x = wa, *y = wb;
		for (i = 0; i < m; ++i)
			wn[i] = 0;
		for (i = 0; i < n; ++i)
			wn[x[i] = r[i]]++;
		for (i = 1; i < m; ++i)
			wn[i] += wn[i - 1];
		for (i = n - 1; i >= 0; --i)
			sa[--wn[x[i]]] = i;

		for (j = 1, p = 0; p < n; j <<= 1, m = p) {
			for (p = 0, i = n - j; i < n; ++i)
				y[p++] = i;
			for (i = 0; i < n; ++i)
				if (sa[i] >= j)
					y[p++] = sa[i] - j;

			for (i = 0; i < n; ++i)
				wv[i] = x[y[i]];
			for (i = 0; i < m; ++i)
				wn[i] = 0;
			for (i = 0; i < n; ++i)
				wn[wv[i]]++;
			for (i = 1; i < m; ++i)
				wn[i] += wn[i - 1];
			for (i = n - 1; i >= 0; --i)
				sa[--wn[wv[i]]] = y[i];

			p = 1, t = x, x = y, y = t;
			for (x[sa[0]] = 0, i = 1; i < n; ++i)
				x[sa[i]] = cmp(y, sa[i - 1], sa[i], j) ? p - 1 : p++;
		}
	}
	int LCP(int x, int y) {
		x = rank[x] + 1;
		y = rank[y] + 1;
		if (x > y)
			swap(x, y);
		return RMQ.query(x, y);
	}
	int left(int pos, int len) {
		int l, r;
		pos = pos[rank];
		l = 0, r = pos;
		int m, t, ans = r;
		while (l <= r) {
			m = (l + r) >> 1;
			t = RMQ.query(m + 1, pos + 1);
			if (t >= len)
				ans = m, r = m - 1;
			else
				l = m + 1;
		}
		return ans;
	}
	int right(int pos, int len) {
		int l, r;
		pos = rank[pos];
		l = pos, r = n;
		int m, t, ans = l;
		while (l <= r) {
			m = (l + r) >> 1;
			t = RMQ.query(pos + 1, m + 1);
			if (t >= len)
				ans = m, l = m + 1;
			else
				r = m - 1;
		}
		return ans;
	}
	void print_sa(int n) {
		int i;
		for (i = 0; i <= n; ++i) {
			printf("%d %s\n", h[i], &s[sa[i]]);
		}
	}
} suffix;
int main() {
	ll k;
	int i, j, n, m, len, l, r, cnt, num, p, t;
	ll tv;
	P[0] = 1;
	for (i = 1; i < maxn; ++i)
		P[i] = Mod(P[i - 1] * 26);
	int T;
	scanf("%d", &T);
	while (T--) {
		scanf("%d%d", &n, &m);
		len = n;
		scanf("%s", s);
		s[n] = '$';
		for (i = 0; i <= n; ++i)
			o[i] = -1;
		for (i = n + 1, j = n - 1; j >= 0; --j, ++i)
			s[i] = s[j], o[i] = j;
		n = i;
		s[n] = 0;
		for (i = 0; i <= n; ++i)
			a[i] = (int) s[i];
		suffix.Da(a, n + 1, 128);
		suffix.Calheight(a, n);
		RMQ.n = n;
		RMQ.make(suffix.h);
		tot = 0;
		for (i = 1, num = maxn; i <= n; ++i) {
			num = min(num, suffix.h[i]);
			p = suffix.sa[i];
			if (~o[p]) {
				cnt = suffix.LCP(p, o[p]);
				if (cnt > num) {
					t = cnt;
					for (j = t; j > num; --j) {
						f[tot].l = o[p] - j + 1;
						f[tot].m = o[p];
						f[tot++].len = j * 2 - 1;
					}
					num = cnt;
				}
			}
		}
		for (i = 1, num = maxn; i <= n; ++i) {
			num = min(num, suffix.h[i]);
			p = suffix.sa[i];
			if (~o[p]) {
				cnt = suffix.LCP(p, o[p] + 1);
				if (cnt > num) {
					t = cnt;
					for (j = t; j > num; --j) {
						f[tot].l = o[p] - j + 1;
						f[tot].m = o[p];
						f[tot++].len = j * 2;
					}
					num = cnt;
				}
			}
		}
		for (i = 0; i < tot; ++i) {
			l = suffix.left(f[i].l, f[i].len);
			r = suffix.right(f[i].l, f[i].len);
			S[i] = (r - l + 1) >> 1;
		}
		while (m--) {
			scanf("%lld", &k);
			for (i = 0; i < 26; ++i)
				scanf("%d", val + i);
			tmp[0] = val[s[0] - 'a'];

			for (i = 1; i < len; ++i) {
				tmp[i] = Mod(tmp[i - 1] * 26 + val[s[i] - 'a']);
			}
			for (i = 0; i < tot; ++i) {
				l = f[i].l - 1;
				r = f[i].m;
				j = (f[i].len + 1) >> 1;
				tv = tmp[r];
				if (l >= 0)
					tv -= tmp[l] * P[j];
				tv = (tv % mod + mod) % mod;
				res[i].first = (int)tv;
				res[i].second = S[i];
			}
			sort(res, res + tot);
			for (i = 0; i < tot; ++i) {
				if (k > res[i].second)
					k -= res[i].second;
				else {
					printf("%d\n", res[i].first);
					break;
				}
			}
		}
		puts("");
	}
	return 0;
}