Codeforces 757C Felicity is Coming!

　　显然我们可以发现答案是每个可以互相到达的集合的大小取排列然后依次相乘起来。考虑如何找到每一个互补相不的集合，即hash。(然而我取了3模数才过)

---

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstdlib>
#include<cmath>
#include<cstring>
using namespace std;
#define maxn 1000010
#define md (llg)(1000100000001007)
#define MD 1000000007
#define md2 (llg)(5456145545456)
#define md3 (llg)(100007)
#define llg long long 
#define yyj(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);
llg n,m,a[maxn],p[maxn],l,r;

struct node
{
    llg a1,a2,a3;
}c[maxn];

bool cmp(const node&a,const node&b)
{
    if (a.a1==b.a1 && a.a2==b.a2) return a.a3<b.a3; 
    if (a.a1==b.a1) return a.a2<b.a2;
    return a.a1<b.a1;
}

int main()
{
    srand(1346);
//    yyj("C");
    p[0]=p[1]=1;
    for (llg i=2;i<=1000000;i++) p[i]=p[i-1]*i,p[i]%=MD;
    cin>>n>>m;
    llg inc=1;
    for (llg k=1;k<=n;k++)
    {
        llg x;
        inc=rand()%md+1; llg inc2=rand()%md+1,inc3=rand()%md+1;
        scanf("%I64d",&x);
        for (llg i=1;i<=x;i++) 
        {
            scanf("%I64d",&a[i]);
            c[a[i]].a1+=inc; c[a[i]].a2+=inc2; c[a[i]].a3+=inc3;
            c[a[i]].a1%=md; c[a[i]].a2%=md2; c[a[i]].a3%=md3;
        }
        inc*=2;
        inc%=md;
    }
    llg ans=1;
    sort(c+1,c+m+1,cmp);
    l=1;
    while (l<=m)
    {
        r=l;
        while (c[r+1].a1==c[l].a1 && c[r+1].a2==c[l].a2 && c[r+1].a3==c[l].a3 && r+1<=m) r++;
        ans*=p[r-l+1];
        ans%=MD;
        l=r+1;
    }
//    for (llg i=1;i<=c[0];i++) ans*=n,ans%=MD; 
    cout<<ans;
    return 0;
}