題意
給出一個字符串,每個字符是 '1'
- '9'
,支持詢問 l, r, d
:str[l...r]
是不是以 d
為週期的。並且支持區間修改,將一段的字符都變成某一個。
http://codeforces.com/contest/580/problem/E
思路
用多項式哈希判斷字符串是否相等。l, r, d
的查詢實際等價于 str[(l + d)...r]
和 str[l...(r - d)]
是不是相等。要支持區間修改,可以使用線段樹維護哈希值。
注意:數據強,用 unsigned
的溢出取模是不能通過這道題的。(卡這個模的數據我也不知道怎麼構造……)
於是本王找來一個大素數 259259257
做模數,就很開心了。
#include <bits/stdc++.h>
using namespace std;
typedef long long llong;
const int MAXN = 100000 + 10;
const int MOD = 259259257;
char str[MAXN];
struct segment_tree
{
struct node
{
llong hsh;
int lzy;
int l, r;
int mid()
{ return (l + r) >> 1; }
} tree[MAXN << 2];
llong base_pow[MAXN];
llong hsh_pow[10][MAXN];
void build(int i, int l, int r)
{
tree[i].l = l;
tree[i].r = r;
tree[i].lzy = -1;
if (l == r) {
tree[i].hsh = str[l];
return;
}
int mid = tree[i].mid();
build(i << 1, l, mid);
build(i << 1 | 1, mid + 1, r);
tree[i].hsh = (tree[i << 1].hsh +
tree[i << 1 | 1].hsh * base_pow[mid - l + 1]) % MOD;
}
void init(int n, llong base)
{
base_pow[0] = 1;
for (int i = 1; i <= n; ++i)
base_pow[i] = base_pow[i - 1] * base % MOD;
for (int i = 0; i < 10; ++i) {
llong* hsh_ptr = hsh_pow[i];
llong chari = '0' + i;
hsh_ptr[1] = chari;
for (int j = 2; j <= n; ++j)
hsh_ptr[j] = (hsh_ptr[j - 1] * base + chari) % MOD;
}
build(1, 1, n);
}
void push_down(int i)
{
if (tree[i].lzy == -1 || tree[i].l == tree[i].r)
return;
int lazy = tree[i].lzy;
int mid = tree[i].mid();
tree[i << 1].lzy = lazy;
tree[i << 1 | 1].lzy = lazy;
tree[i << 1].hsh = hsh_pow[lazy][mid - tree[i].l + 1];
tree[i << 1 | 1].hsh = hsh_pow[lazy][tree[i].r - mid];
tree[i].lzy = -1;
}
void push_up(int i)
{
int mid = tree[i].mid();
tree[i].hsh = (tree[i << 1].hsh +
tree[i << 1 | 1].hsh * base_pow[mid - tree[i].l + 1]) % MOD;
}
void update(int i, int l, int r, int d)
{
push_down(i);
if (l == tree[i].l && tree[i].r == r) {
tree[i].lzy = d;
tree[i].hsh = hsh_pow[d][tree[i].r - tree[i].l + 1];
return;
}
int mid = tree[i].mid();
if (r <= mid)
update(i << 1, l, r, d);
else if (l > mid)
update(i << 1 | 1, l, r, d);
else {
update(i << 1, l, mid, d);
update(i << 1 | 1, mid + 1, r, d);
}
push_up(i);
}
pair<llong, int> query(int i, int l, int r)
{
push_down(i);
if (l == tree[i].l && tree[i].r == r)
return make_pair(tree[i].hsh, r - l + 1);
int mid = tree[i].mid();
pair<llong, int> ans;
if (r <= mid) {
ans = query(i << 1, l, r);
} else if (l > mid) {
ans = query(i << 1 | 1, l, r);
} else {
pair<llong, int> left = query(i << 1, l, mid);
pair<llong, int> right = query(i << 1 | 1, mid + 1, r);
llong hsh = (left.first + right.first * base_pow[left.second]) % MOD;
int length = left.second + right.second;
ans = make_pair(hsh, length);
}
push_up(i);
return ans;
}
bool check(int l, int r, int d)
{
if (r - l + 1 == d)
return true;
llong hsh1 = query(1, l + d, r).first;
llong hsh2 = query(1, l, r - d).first;
return hsh1 == hsh2;
}
void print(int i)
{
push_down(i);
if (tree[i].l == tree[i].r) {
cout << (char) (tree[i].hsh);
return;
}
print(i << 1);
print(i << 1 | 1);
}
} st;
int main()
{
int n, m, k;
scanf("%d %d %d", &n, &m, &k);
scanf("%s", str + 1);
srand(time(0));
st.init(n, 1000 + 7U);
for (int i = 1; i <= m + k; ++i) {
int cmd;
int l, r, d;
scanf("%d %d %d %d", &cmd, &l, &r, &d);
switch(cmd) {
case 1:
st.update(1, l, r, d);
break;
case 2:
printf("%s\n", st.check(l, r, d) ? "YES" : "NO");
break;
default: break;
}
}
return 0;
}