codeforces960G Bandit Blues

个人认为比较好的题解：题解

其实用分治或者还是优先队列都是可以的，之前有一题是用优先队列写的（每次拿长度最短的两个做NTT）

#include"bits/stdc++.h"
using namespace std;
typedef long long LL;
const int mod = 998244353;
const int MX = 1e5+7;
const int P = 998244353; //p为取模的值
const int G = 3;
const int NUM = 20;  //2^20数组大小
LL  wn[NUM];
LL  va[MX<<2],vb[MX<<2];
LL quick_mod(LL a, LL x, LL mod) {
    LL ans = 1;
    a %= mod;
    while(x) {
        if(x & 1)ans = ans * a % mod;
        x >>= 1;
        a = a * a % mod;
    }
    return ans;
}
//在程序的开头就要放(初始化)
void GetWn() {
    for(int i = 0; i < NUM; i++) {
        int t = 1 << i;
        wn[i] = quick_mod(G, (P - 1) / t, P);
    }
}
void Rader(LL F[], int len) {
    int j = len >> 1;
    for(int i = 1; i < len - 1; i++) {
        if(i < j) swap(F[i], F[j]);
        int k = len >> 1;
        while(j >= k)j -= k,k >>= 1;
        if(j < k) j += k;
    }
}
void NTT(LL F[], int len, int t) {
    Rader(F, len);
    int id = 0;
    for(int h = 2; h <= len; h <<= 1) {
        id++;
        for(int j = 0; j < len; j += h) {
            LL E = 1;
            for(int k = j; k < j + h / 2; k++) {
                LL u = F[k];
                LL v = E * F[k + h / 2] % P;
                F[k] = (u + v) % P;
                F[k + h / 2] = (u - v + P) % P;
                E = E * wn[id] % P;
            }
        }
    }
    if(t == -1) {
        for(int i = 1; i < len / 2; i++)swap(F[i], F[len - i]);
        LL inv = quick_mod(len, P - 2, P);
        for(int i = 0; i < len; i++)F[i] = F[i] * inv % P;
    }
}
void Conv(LL a[], LL b[], int len) {
    NTT(a, len, 1);
    NTT(b, len, 1);
    for(int i = 0; i < len; i++)a[i] = a[i] * b[i] % P;
    NTT(a, len, -1);
}

vector<LL> s;
void solve(int l, int r, vector<LL> &s)
{
    if(l == r){
        s.push_back(l);
        s.push_back(1);
        return ;
    }
    int mid = l+r>>1, lx = 0, rx = 0;
    vector<LL> t1,t2;
    solve(l,mid,t1);
    solve(mid+1,r,t2);
    for(int i = 0; i < t1.size(); i++) va[lx++] = t1[i]; lx--;
    for(int i = 0; i < t2.size(); i++) vb[rx++] = t2[i]; rx--;
    int len = 1;
    while(len <= lx+rx) len <<= 1;
    for(int i = lx+1; i < len; i++) va[i] = 0;
    for(int i = rx+1; i < len; i++) vb[i] = 0;
    Conv(va,vb,len);
    for(int i = 0; i <= lx+rx; i++) s.push_back(va[i]);
}
LL fac[MX], inv[MX];
void init()
{
    int n = 1e5+2;
    fac[0] = fac[1] = inv[0] = inv[1] = 1;
    for(int i = 2; i <= n; i++){
        fac[i] = fac[i-1]*i%mod;
        inv[i] = (mod-mod/i)*inv[mod%i]%mod;
    }
    for(int i = 2; i <= n; i++)
        inv[i] = inv[i]*inv[i-1]%mod;
}
int C(int n, int m)
{
    if(n < m) return 0;
    return fac[n]*inv[m]%mod*inv[n-m]%mod;
}
int main()
{
    int n,A,B;
    init();
    GetWn();
    scanf("%d%d%d",&n,&A,&B);
    if(!A || !B || A+B > n+1){
        printf("0\n");
        return 0;
    }
    if(n == 1){
        if(A == 1 && B == 1) printf("1\n");
        else printf("0\n");
        return 0;
    }
    solve(0,n-2,s);
    printf("%lld\n",s[A+B-2]*C(A+B-2,A-1)%mod);
}