zcmimi's blog
avatar
zc
2020-01-28 01:23:00
  • 本文总阅读量
查看原题

点击跳转

所有环的siz+1的乘积,注意要高精度

#include<bits/stdc++.h>
namespace ZDY{
    #pragma GCC optimize(3)
    #define il __inline__ __attribute__ ((always_inline))
    #define register
    #define ll long long
    #define ull unsigned long long
    #define db double
    #define sht short
    #define MB template <class T>il
    #define Fur(i,x,y) for(int i(x);i<=y;++i)
    #define Fdr(i,x,y) for(int i(x);i>=y;--i)
    #define fl(i,x) for(int i(head[x]),to;to=e[i].to,i;i=e[i].nxt)
    #define clr(x,y) memset(x,y,sizeof(x))
    #define cpy(x,y) memcpy(x,y,sizeof(x))
    #define fin(s) freopen(s".in","r",stdin)
    #define fout(s) freopen(s".out","w",stdout)
    #define fcin ios::sync_with_stdio(false)
    #define l2(n) ((int)(log2(n)))
    #define inf 2122219134
    MB T ABS(T x){return x>0?x:-x;}
    MB T MAX(T x,T y){return x>y?x:y;}
    MB T MIN(T x,T y){return x<y?x:y;}
    MB T GCD(T x,T y){return y?GCD(y,x%y):x;}
    MB void SWAP(T &x,T &y){T t=x;x=y;y=t;}
}using namespace ZDY;using namespace std;
namespace IO{const int str=1<<20;static char in_buf[str],*in_s,*in_t;bool __=0;il char gc(){return (in_s==in_t)&&(in_t=(in_s=in_buf)+fread(in_buf,1,str,stdin)),in_s==in_t?__=1,EOF:*in_s++;}il void in(string &ch){ch.clear();if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF){__=1;return;}ch+=c;while((c=gc())!=EOF&&!isspace(c))ch+=c;if(c==EOF)__=1;}il void in(char &ch){if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF)__=1;else ch=c;}il void in(char *ch){*ch='\0';if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF){__=1;return;}*ch=c;ch++;while((c=gc())!=EOF&&!isspace(c))*ch=c,ch++;if(c==EOF)__=1;*ch='\0';}template<typename T>il void in(T &x){if(__)return;char c=gc();bool f=0;while(c!=EOF&&(c<'0'||c>'9'))f^=(c=='-'),c=gc();if(c==EOF){__=1;return;}x=0;while(c!=EOF&&'0'<=c&&c<='9')x=x*10+c-48,c=gc();if(c==EOF)__=1;if(f)x=-x;}template<typename T,typename ... arr>il void in(T &x,arr & ... y){in(x),in(y...);}const char ln='\n';static char out_buf[str],*out_s=out_buf,*out_t=out_buf+str;il void flush(){fwrite(out_buf,1,out_s-out_buf,stdout);out_s=out_buf;}il void pt(char c){(out_s==out_t)?(fwrite(out_s=out_buf,1,str,stdout),*out_s++=c):(*out_s++=c);}il void out(const char* s){while(*s)pt(*s++);}il void out(char* s){while(*s)pt(*s++);}il void out(char c){pt(c);}il void out(string s){for(int i=0;s[i];i++)pt(s[i]);}template<typename T>il void out(T x){if(!x){pt('0');return;}if(x<0)pt('-'),x=-x;char a[50],t=0;while(x)a[t++]=x%10,x/= 10;while(t--)pt(a[t]+'0');}template<typename T,typename ... arr>il void out(T x,arr & ... y){out(x),out(y...);}}using namespace IO;
const int N=20011;
void ext(){printf("0\n"),exit(0);}
int n,m,cnt=1,head[N];
int ans[N],len=0;
struct edge{
    int to,nxt;
}e[2000011];
il void add(int x,int y){
    e[++cnt].to=y;e[cnt].nxt=head[x];head[x]=cnt;
    e[++cnt].to=x;e[cnt].nxt=head[y];head[y]=cnt;
}
int dfn[N],low[N],sz=0,fa[N];
bool v[N];
void solve(int x,int y){
    int t=2;
    for(int i=y;i!=x;i=fa[i]){
        ++t;
        if(v[i])ext();
        v[i]=1;
    }
    Fur(i,0,len)ans[i]*=t;
    Fur(i,0,len-1)if(ans[i]>9){
        ans[i+1]+=ans[i]/10;
        ans[i]%=10;
    }
    while(ans[len]>9)
        ans[len+1]+=ans[len]/10,ans[len]%=10,++len;
}
void tarjan(int x,int la){
    dfn[x]=low[x]=++sz;
    fl(i,x)if(i!=la){
        if(!dfn[to]){
            fa[to]=x;
            tarjan(to,i^1);
            low[x]=MIN(low[x],low[to]);
        }
        else low[x]=MIN(low[x],dfn[to]);
    }
    fl(i,x)if(fa[to]!=x&&dfn[to]>dfn[x])solve(x,to);
}
il void init(){
    in(n,m);
    while(m--){
        int t,x,y;in(t,x);
        while(--t)in(y),add(x,y),x=y;
    }
}
int main(){
    init();
    ans[0]=1;
    tarjan(1,0);
    if(sz!=n)ext();
    Fdr(i,len,0)putchar(ans[i]+48);
}
LG 4129 [SHOI2006]仙人掌
comment评论
Search
search