2022 CCPC Henan Provincial Collegiate Programming Contest
Problem
Solution
然后线段树维护区间中有多少个位置必须放置隔板。
维护方式:单独维护区间中16种相邻字符的数量,具体的:维护区间中 AA,AB,AC,AD … DA,DB,DC,DD的数量。(我的代码用0~15代表这16种组合)
Code
时间复杂度:
O
(
16
n
l
o
g
n
)
O(16nlogn)
O(16nlogn)
实现起来有一点点复杂,需要注意一些细节。以及要注意非法查询
const ll mod = 998244353;
using namespace std;
const int N = 2e5 + 5;
struct node
{
int l, r;
int lc, rc;//区间中左右端点的字母
int cnt[16];//每种对子的数量, cnt[9]:9 / 4 = 2, 9 % 4 = 1, 所以 cnt[9] 代表区间[l, r]中 CB 出现的次数 (0~3对应A~D)
int lazy;
}t[N * 4];
#define tp t[p]
#define tl t[p << 1]
#define tr t[p << 1 | 1]
string s;
void pushup(int p)
{
//cout << "pushup\n";
for (int i = 0; i < 16; i++)
{
int x = i / 4, y = i % 4;
tp.cnt[i] = tl.cnt[i] + tr.cnt[i];
}
tp.cnt[tl.rc * 4 + tr.lc]++;//两段中间构成的字符
tp.lc = tl.lc; tp.rc = tr.rc;
}
void build(int p, int l, int r)
{
tp.l = l; tp.r = r; tp.lazy = 0;
mt(tp.cnt, 0);
if (l == r) { tp.lc = tp.rc = s[l - 1] - 'A'; return; }
int mid = l + r >> 1;
build(p << 1, l, mid);
build(p << 1 | 1, mid + 1, r);
pushup(p);
}
void tran(int p, int d)//对区间[l, r]内的字母循环移动d次
{
int temp[16];
for (int i = 0; i < 16; i++)
{
int x = i / 4, y = i % 4;
x = (x + d) % 4, y = (y + d) % 4;
temp[x * 4 + y] = tp.cnt[i];
}
for (int i = 0; i < 16; i++)
tp.cnt[i] = temp[i];
tp.lc = (tp.lc + d) % 4;
tp.rc = (tp.rc + d) % 4;
}
void spread(int p)//等于pushdown
{
if (tp.lazy)
{
tran(p << 1, tp.lazy);
tran(p << 1 | 1, tp.lazy);
tl.lazy += tp.lazy;
tr.lazy += tp.lazy;
tp.lazy = 0;
}
}
void change(int p, int l, int r)
{
if (l <= tp.l && tp.r <= r)
{
tran(p, 1);
tp.lazy++;
return;
}
spread(p);
int mid = tp.l + tp.r >> 1;
if (l <= mid) change(p << 1, l, r);
if (r > mid) change(p << 1 | 1, l, r);
pushup(p);
}
int ask(int p, int l, int r)//对于连续的两个字符ab,找区间中满足 a >= b 的数量
{
int sum = 0;
if (l <= tp.l && tp.r <= r)
{
for (int i = 0; i < 4; i++)
for (int j = 0; j <= i; j++)
sum += tp.cnt[i * 4 + j];
return sum;
}
spread(p);
int mid = tp.l + tp.r >> 1;
if (l <= mid) sum += ask(p << 1, l, r);
if (r > mid) sum += ask(p << 1 | 1, l, r);
if (l <= mid && r > mid && tl.rc >= tr.lc) sum++;//这里要注意!!!
return sum;
}
ll ksm(ll a, ll b)
{
ll ans = 1;
for (; b; b >>= 1)
{
if (b & 1) ans = ans * a % mod;
a = a * a % mod;
}
return ans;
}
ll fac[N], inv[N];//阶乘和逆元
void init()
{
inv[0] = fac[0] = 1;
for (int i = 1; i < N; i++)
{
fac[i] = fac[i - 1] * i % mod;
inv[i] = inv[i - 1] * ksm(i, mod - 2) % mod;
}
}
ll C(ll n, ll m)
{
if (n < m || n < 0 || m < 0) return 0;
return fac[n] * inv[m] % mod * inv[n - m] % mod;
}
int main()
{
IOS;
int n, q; cin >> n >> q;
cin >> s;
build(1, 1, n);
init();
while (q--)
{
int op; cin >> op;
if (op == 1)
{
int l, r; cin >> l >> r;
change(1, l, r);
}
else
{
int l, r, k; cin >> l >> r >> k;
int c = ask(1, l, r);
if (k > r - l + 1 || k < c + 1)//不合法
{
cout << "0\n";
continue;
}
cout << C(r - l - c, k - 1 - c) << endl;
}
}
return 0;
}