题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4975
题意:和hdu4888基本一样( http://www.cnblogs.com/a-clown/p/6670043.html ),但是这题的时间限制是1000ms 比较卡时间需要优化。
思路:看学长的代码,用引用优化,加一个&i 这样i的本质就是用来改变head[i]的值,本来head[u]记录的是原图的所有信息,
但现在head[u]一直在靠近最后的点,相当于遍历过一次就不会再继续遍历到这个点了。相当于做了优化,dfs过的点直接剪枝了。
AC代码:
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<queue> using namespace std; const int MAXN=1005; const int MAXM=1005*1005*4; const int INF=0x3f3f3f3f; struct Edge { int to,next,cap,flow; } edge[MAXM]; int tol; int head[MAXN]; int gap[MAXN],dep[MAXN],pre[MAXN],cur[MAXN]; void init() { tol=0; memset(head,-1,sizeof(head)); } void Addedge(int u,int v,int w,int rw=0) { edge[tol].to = v; edge[tol].cap = w; edge[tol].next = head[u]; edge[tol].flow = 0; head[u] = tol++; edge[tol].to = u; edge[tol].cap = rw; edge[tol].next = head[v]; edge[tol].flow = 0; head[v]=tol++; } int sap(int start,int end,int N) { memset(gap,0,sizeof(gap)); memset(dep,0,sizeof(dep)); memcpy(cur,head,sizeof(head)); int u=start; pre[u]=-1; gap[0]=N; int ans=0; while(dep[start]<N) { if(u==end) { int Min=INF; for(int i=pre[u]; i!=-1; i=pre[edge[i^1].to]) if(Min>edge[i].cap-edge[i].flow) Min=edge[i].cap-edge[i].flow; for(int i=pre[u]; i!=-1; i=pre[edge[i^1].to]) { edge[i].flow+=Min; edge[i^1].flow-=Min; } u=start; ans+=Min; continue; } bool flag=false; int v; for(int i=cur[u]; i!=-1; i=edge[i].next) { v=edge[i].to; if(edge[i].cap-edge[i].flow && dep[v]+1==dep[u]) { flag=true; cur[u]=pre[v]=i; break; } } if(flag) { u=v; continue; } int Min=N; for(int i=head[u]; i!=-1; i=edge[i].next) if(edge[i].cap-edge[i].flow && dep[edge[i].to]<Min) { Min=dep[edge[i].to]; cur[u]=i; } gap[dep[u]]--; if(!gap[dep[u]])return ans; dep[u]=Min+1; gap[dep[u]]++; if(u!=start) u=edge[pre[u]^1].to; } return ans; } bool vit[MAXN],sing[MAXN]; int n,m; int dfs(int u,int p) { if(vit[u])return 1; vit[u]=1; for(int &i=head[u]; i!=-1; i=edge[i].next) { int v=edge[i].to; if(v!=p && edge[i].cap-edge[i].flow>0) if(dfs(v,u)) return 1; } vit[u]=0; return 0; } int main() { int T; scanf("%d",&T); for(int t=1; t<=T; t++) { init(); scanf("%d%d",&n,&m); int sum1=0,sum2=0; int x; for(int i=1; i<=n; i++) { scanf("%d",&x); sum1+=x; Addedge(0,i,x); } for(int i=1; i<=m; i++) { scanf("%d",&x); sum2+=x; Addedge(i+n,n+m+1,x); } if(sum1!=sum2) { printf("Case #%d: So naive!\n",t); continue; } for(int i=1; i<=n; i++) for(int j=1; j<=m; j++) Addedge(i,j+n,9); int ans=sap(0,n+m+1,n+m+2); if(ans==sum1 && ans==sum2) { int flag=0; memset(vit,0,sizeof(vit)); for(int i=1; i<=n; i++) { memset(vit,0,sizeof(vit)); if(dfs(i,-1)) { flag=1; break; } } if(flag) printf("Case #%d: So young!\n",t); else printf("Case #%d: So simple!\n",t); } else printf("Case #%d: So naive!\n",t); } return 0; }