analysis
这个题的难点其实不在算法上,而在读题上,若将题读懂了就好了
仔细研究定义可得,半联通子图其实就包含强联通子图和链,(链也是一个半联通子图),于是缩点后问题就转化为图中最长链的长度和条数,用记搜即可。记搜时维护两个变量:maxdep[i],f[i],分别指i号节点的最大深度和i号节点在当前最大深度的可行方案数,于是就可以AC了
code
#include<bits/stdc++.h>
using namespace std;
#define loop(i,start,end) for(int i=start;i<=end;++i)
#define anti_loop(i,start,end) for(register int i=start;i>=end;--i)
#define max(a,b) ((a>b)?a:b)
#define min(a,b) ((a<b)?a:b)
#define ll long long
#define clean(arry,num) memset(arry,num,sizeof(arry))
template<typename T>void read(T &x){
x=0;char r=getchar();T neg=1;
while(r>'9'||r<'0'){if(r=='-')neg=-1;r=getchar();}
while(r>='0'&&r<='9'){x=(x<<3)+(x<<1)+r-'0';r=getchar();}
x*=neg;
}
int n,m,mod,cnt=0;
const int maxn=100000+10;
const int maxm=1000000+10;
struct e{int _u;int _v;}line[maxm];
struct node{int _v;int nxt;}edge[maxm];
int head[maxn];
inline void addl(int u,int v){edge[cnt]._v=v;edge[cnt].nxt=head[u];head[u]=cnt++;}
int dfn[maxn],low[maxn],siz[maxn],bel[maxn],col=0,num=0;
int sta[maxn],top=0;
void tarjan(int u){
dfn[u]=low[u]=++num;sta[++top]=u;
for(int i=head[u];i!=-1;i=edge[i].nxt){
if(!dfn[edge[i]._v]){
tarjan(edge[i]._v);
low[u]=min(low[u],low[edge[i]._v]);
}else if(!bel[edge[i]._v])low[u]=min(low[u],dfn[edge[i]._v]);
}if(low[u]==dfn[u]){
bel[u]=++col;
++siz[col];
while(top>=0&&sta[top]!=u){
bel[sta[top]]=col;
++siz[col];
--top;
}
--top;
}
}
int in[maxn];
inline bool cmp(e a,e b){return ((a._u==b._u)?a._v<b._v:a._u<b._u);}
inline void reset(){
loop(i,1,m){
line[i]._u=bel[line[i]._u];
line[i]._v=bel[line[i]._v];
}sort(line+1,line+1+m,cmp);
}
inline void rebuild(){
reset(),clean(head,-1),cnt=0;
loop(i,1,m)
if(line[i]._u!=line[i]._v&&(line[i]._u!=line[i-1]._u||line[i]._v!=line[i-1]._v))
addl(line[i]._u,line[i]._v),++in[line[i]._v];
}
bool vis[maxn];
int maxdep[maxn];
int f[maxn];
int dfs(int u){
int _maxx=-1;vis[u]=true;
for(int i=head[u];i!=-1;i=edge[i].nxt){
int v=edge[i]._v;
int _res;
if(maxdep[u]==-1)_res=dfs(v);
else _res=maxdep[v];
if(_res>_maxx)f[u]=f[v],f[u]=f[u]%mod,_maxx=_res;
else if(_res==_maxx)f[u]+=f[v],f[u]=f[u]%mod;
}maxdep[u]=_maxx+siz[u];
if(_maxx==-1)f[u]=1,maxdep[u]=siz[u];
return maxdep[u];
}
int main(){
#ifndef ONLINE_JUDGE
freopen("datain.txt","r",stdin);
#endif // ONLINE_JUDGE
read(n),read(m),read(mod);clean(bel,0);clean(in,0);clean(maxdep,-1);
clean(head,-1);clean(dfn,0),clean(low,0),clean(siz,0);clean(f,0);
loop(i,1,m){read(line[i]._u),read(line[i]._v);addl(line[i]._u,line[i]._v);}
loop(i,1,n)
if(!dfn[i])
tarjan(i);
rebuild();
register int maxx=0,_res;
loop(i,1,col)
if(!in[i]&&!vis[i])
_res=dfs(i),maxx=max(maxx,_res);
register int _cnt=0;
loop(i,1,n)if(maxdep[i]==maxx)_cnt=(_cnt+f[i])%mod;
printf("%d\n%d\n",maxx,_cnt);
return 0;
}