1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55
| #include<cstdio> #include<cstring> #include<algorithm> using namespace std;
const int N=1e5+10;
struct DSU{ int fa[N]; int FindFa(int u){return fa[u]==u? u:fa[u]=FindFa(fa[u]);} bool Merge(int u,int v){ u=FindFa(u),v=FindFa(v); if(u==v) return false; fa[u]=v; return true; } void Init(int siz){ for(int i=0;i<=siz;i++) fa[i]=i; } }; DSU Ds;
int n,m,mod,cnt,sum,prd; int siz[N];
#define cs const int & inline int Add(cs a,cs b){return a+b>=mod? a+b-mod:a+b;} inline int Sub(cs a,cs b){return a-b<0? a-b+mod:a-b;} inline int Mul(cs a,cs b){return 1ll*a*b%mod;} inline int Pow(int a,int b){int r=1;while(b){if(b&1)r=Mul(r,a);a=Mul(a,a),b>>=1;}return r;}
inline int Ri(){ register int a=0,c=getchar(); while(c<'0' || '9'<c) c=getchar(); while('0'<=c && c<='9') a=(a<<1)+(a<<3)+c-'0',c=getchar(); return a; } int main(){ n=Ri(),m=Ri(),mod=Ri(); Ds.Init(n); for(int i=1;i<=m;i++) Ds.Merge(Ri(),Ri()); for(int i=1;i<=n;i++) siz[Ds.FindFa(i)]++; prd=1; for(int i=1;i<=n;i++) if(siz[i]){ prd=Mul(prd,siz[i]); sum=Add(sum,siz[i]); cnt++; } if(cnt==1) printf("%d\n",1%mod); else printf("%d\n",Mul(prd,Pow(sum,cnt-2))); return 0; }
|