Atcoder AGC012D：Colorful Balls

传送门

题解：
容易发现交换具有传递性。所以答案为每个联通块方案之积。

进一步发现只需要与每种颜色最小的连边，之后统计出每个联通块的方案数为：

$$\frac{n!}{\Pi a_i!}$$

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int RLEN=1<<18|1;
inline char nc() {
    static char ibuf[RLEN],*ib,*ob;
    (ib==ob) && (ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
    return (ib==ob) ? -1 : *ib++;
}
inline int rd() {
    char ch=nc(); int i=0,f=1;
    while(!isdigit(ch)) {if(ch=='-')f=-1; ch=nc();}
    while(isdigit(ch)) {i=(i<<1)+(i<<3)+ch-'0'; ch=nc();}
    return i*f;
}

const int N=2e5+50,mod=1e9+7,INF=0x3f3f3f3f;
inline int add(int x,int y) {return (x+y>=mod) ? (x+y-mod) : (x+y);}
inline int dec(int x,int y) {return (x-y<0) ? (x-y+mod) : (x-y);}
inline int mul(int x,int y) {return (LL)x*y%mod;}
inline int power(int a,int b,int rs=1) {
    for(;b;b>>=1,a=mul(a,a)) if(b&1) rs=mul(rs,a);
    return rs;
}
int n,X,Y,lst[N],anc[N],fac[N],ifac[N],mnw[N],fir[N],p[N];
map <int,int> S[N];
struct data {int c,w;}a[N];
inline int ga(int x) {return (anc[x]==x) ? x : (anc[x]=ga(anc[x]));}
inline int merge(int a,int b) {return anc[ga(a)]=ga(b);}
inline bool cmp_mnw(int a,int b) {return mnw[a]<mnw[b];}
int main() {
    memset(mnw,0x3f,sizeof(mnw));
    n=rd(); X=rd(); Y=rd(); fac[0]=1;
    for(int i=1;i<=n;i++) fac[i]=mul(fac[i-1],i);
    ifac[n]=power(fac[n],mod-2);
    for(int i=n-1;~i;i--) ifac[i]=mul(ifac[i+1],i+1);
    int fr=-1, sc=-1;
    for(int i=1;i<=n;i++) {
        a[i].c=rd(), a[i].w=rd(), anc[i]=i;
        if(mnw[a[i].c]>a[i].w) fir[a[i].c]=i, mnw[a[i].c]=a[i].w;
    }
    for(int i=1;i<=n;i++) {
        if(!~fr || mnw[fr]>mnw[i]) sc=fr,fr=i;
        else if(!~sc || mnw[sc]>mnw[i]) sc=i;
    }
    for(int i=1;i<=n;i++) {
        if(a[fir[a[i].c]].w+a[i].w<=X) merge(fir[a[i].c],i);
        int y=(fr==a[i].c) ? sc : fr;
        if(~y && (mnw[y]+a[i].w)<=Y) merge(fir[y],i);
    }
    for(int i=1;i<=n;i++) S[ga(i)][a[i].c]++;
    int ans=1;
    for(int i=1;i<=n;i++) {
        if(ga(i)!=i) continue;
        int sum=0, rs=1;
        for(map <int,int> ::iterator it=S[i].begin(); it!=S[i].end(); ++it) {
            rs=mul(rs,ifac[it->second]); 
            sum+=it->second;
        }
        rs=mul(rs,fac[sum]); 
        ans=mul(ans,rs);
    }
    cout<<ans;
}