poj Network of Schools

//经典题目

//首先形成根据强连通分缩点形成量DAG,然后算MAX(出入为0,入度为0),因为度为0时候一定需要一条边才能使缩点后的DAG重新强连通

//注意求第一问时候应该用点着色,若着色点已经被着色,则将以前的颜色刷走,另外,之前第一问自己从拓扑排序的结果dfs是错误的,因为不能保证先搜的点总能是一个树根(环路时候还没有入度为0点呢)

/* ID:1192432 PROG: castle LANG: C++ */ #include <iostream> #include <queue> #include <string> #include <map> #include <vector> #include <cstring> #include <cstdio> #include <cmath> #include <algorithm> using namespace std; const int MAX=105,INF=1<<30; struct Edge{ int u,v; }; int n; int u[MAX*MAX],v[MAX*MAX],next[MAX*MAX], first[MAX],l; bool vis[MAX][MAX]; bool instack[MAX]; int time,cnt, stack[MAX],top, DFN[MAX],LOW[MAX], belong[MAX]; Edge E[MAX*MAX]; int pa[MAX]; bool co[MAX]; int outdegree[MAX],indegree[MAX]; int ans1=0; void tarjan(int i){ int j; DFN[i]=LOW[i]=++time; stack[++top]=i; instack[i]=1; for(int e=first[i];e!=-1;e=next[e]){ j=v[e]; if(!DFN[j]){ tarjan(j); if(LOW[i]>LOW[j]) LOW[i]=LOW[j]; } else if(instack[j]&&LOW[i]>DFN[j]){ LOW[i]=DFN[j]; } } if(DFN[i]==LOW[i]){ ++cnt; do{ j=stack[top--]; instack[j]=0; belong[j]=cnt; }while(i!=j); } return ; } void reDfs(int i,int color){ DFN[i]=color; for(int e=first[i];e!=-1;e=next[e]) if(DFN[v[e]]!=color) reDfs(v[e],color); return ; } void dfs(int i,int color){ DFN[i]=color; for(int e=first[i];e!=-1;e=next[e]){ if(!DFN[v[e]]){ dfs(v[e],color); } else if(DFN[v[e]]&&DFN[v[e]]!=color){ //--ans1; reDfs(v[e],color); } } return ; } int main() { #ifndef ONLINE_JUDGE freopen("i.txt", "r", stdin); #endif int color; int outCnt=0,inCnt=0; int t; cin>>n; l=0; memset(first,-1,sizeof(first)); for(int i=1;i<=n;i++){ while(cin>>t,t){ u[l]=i; v[l]=t; next[l]=first[i]; first[i]=l++; } } color=1; top=-1; time=cnt=0; memset(DFN,0,sizeof(DFN)); for(int i=1;i<=n;i++){ if(!DFN[i]){ ++color; //++ans1; dfs(i,color); } } for(int i=1;i<=n;i++){ if(!co[DFN[i]]){ ++co[DFN[i]]; ++ans1; } } memset(DFN,0,sizeof(DFN)); for(int i=1;i<=n;i++){ if(!DFN[i]) tarjan(i); } // cout<<"Component:"<<cnt<<endl; // for(int i=1;i<=n;i++) // cout<<belong[i]<<endl; // cout<<endl; if(cnt==1) goto ans; l=0; for(int i=1;i<=n;i++){ for(int e=first[i];e!=-1;e=next[e]){ int j=v[e]; if(belong[i]!=belong[j]&& !vis[belong[i]][belong[j]]){ vis[belong[i]][belong[j]]=1; //cout<<belong[i]<<" "<<belong[j]<<endl; ++outdegree[belong[i]]; ++indegree[belong[j]]; } } } for(int i=1;i<=cnt;i++){ if(!outdegree[i]) ++outCnt; if(!indegree[i]) ++inCnt; } //out<<"deg: "<<inCnt<<" "<<outCnt<<endl; ans: cout<<ans1<<endl <<max(inCnt,outCnt)<<endl; return 0; }