BZOJ 5123([Lydsy12月赛]线段树的匹配-记忆化搜索)

题意：给定一棵表示 [1, n] 的线段树，请求出它的最大匹配中有多少条边，并求出有多少种最大匹配的方案。

显然线段树形态由长度唯一确定，因此可以用（长度，根节点是否和子树的节点匹配）作为状态进行记忆化搜索

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (998244353)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
typedef pair<ll,ll> pll;
map<pair<ll,bool>  ,pll > f;
void upd(pair<ll,ll> &a, pair<ll,ll> b) {
    if (a.fi!=b.fi) a=max(a,b);
    else a.se=(a.se+b.se)%F;
}
pll composed(pll a,pll b) {
    return mp(a.fi+b.fi, (a.se*b.se)%F);
}
pll Max(pll a,pll b) {
    if (a.fi!=b.fi) return max(a,b);
    else return mp(a.fi,(a.se+b.se)%F);
}
pll dfs(ll x,bool b) {
    if(f.find(mp(x,b))!=f.end()) return f[mp(x,b)];
    pll l0=dfs(x>>1,0),l1=dfs(x>>1,1),r0=dfs((x-(x>>1)),0),r1=dfs((x-(x>>1)),1);
    pll c00=composed(l0,r0),c01=composed(l0,r1),c10=composed(l1,r0),c11=composed(l1,r1);
    if (!b) {
        f[mp(x,0)] = Max(c00,Max(c01,Max(c10,c11)));

    }else {
        f[mp(x,1)] = Max(composed(c00 , mp(1,2)) ,composed(Max(c01,c10), mp(1,1)) );
    }
    return f[mp(x,b)];
}
int main()
{
//  freopen("bzoj5123.in","r",stdin);
//  freopen(".out","w",stdout);
    f[mp(1,0)]=mp(0,1);
    f[mp(1,1)]=mp(-1000,0);
    ll n;
    cin>>n;
    pll ans=dfs(n,0),ans2=dfs(n,1);

    upd(ans,ans2);
    cout<<ans.fi<<' '<<ans.se<<endl;
    return 0;
}