题目大意:
有n支NBA球队,这些队伍属于同一个半区,已知各队目前已经赢了几场以及还要打几场(赢了的场次和没打的场次不一定是和相同半区内的对手),另外已知一个n * n的矩阵,a[i][j]代表i和j还要打的比赛场数。根据这些条件,请问队伍1有没有获得半区冠军的可能性
(若积分相同则均为冠军);
思路:
构出图来是四列的网络流问题:第一列为源点,第二列为代表不含1的比赛的节点,第三列为代表球队2——n的节点,第四列为汇点;
由源点出发连向比赛节点的边,容量为该比赛的场数a[i][j];
每一比赛点连两条边,分别连向第三列中比赛的双方,每条容量为该比赛的场数a[i][j];
第三列中每一队伍节点连向汇点,容量为该队伍最多再胜几场(w[1] + r[1] - w[i],即假设1队剩余比赛全胜的基础上减去i队已经获胜的场次);
求最大流,若最大流小于比赛的总场数sum,说明不可能让1队夺冠;
注意特判如果i队的win[i]已经大于1队最多胜利的场数,直接输出NO
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;
const int maxn=400;
const int maxm=160000;
const int inf=0x3f3f3f3f;
struct edge
{
int v,w,nxt;
}edge[maxm*4];
int head[maxn],cnt;
void add_edge(int u,int v,int w)
{
edge[cnt].v=v;
edge[cnt].w=w;
edge[cnt].nxt=head[u];
head[u]=cnt++;
edge[cnt].v=u;
edge[cnt].w=0;
edge[cnt].nxt=head[v];
head[v]=cnt++;
}
int vis[maxn];
int numh[maxn],h[maxn],curedge[maxn],pre[maxn];
int sap(int s,int t,int n)
{
memset(numh,0,sizeof(numh));
memset(h,0,sizeof(h));
memset(pre,-1,sizeof(pre));
int cur_flow,flow_ans=0,u,tmp,neck,i;
for(i=1;i<=n;i++)
{
curedge[i]=head[i];
}
numh[0]=n;
u=s;
while(h[s]<n)
{
//printf("%d\n",h[s]);
//printf("1111\n");
if(u==t)
{
cur_flow=inf;
for(i=s;i!=t;i=edge[curedge[i]].v)
{
if(cur_flow>edge[curedge[i]].w)
{
neck=i;
cur_flow=edge[curedge[i]].w;
}
}
for(i=s;i!=t;i=edge[curedge[i]].v)
{
tmp=curedge[i];
edge[tmp].w-=cur_flow;
edge[tmp^1].w+=cur_flow;
}
flow_ans+=cur_flow;
u=neck;
}
for(i=curedge[u];i!=-1;i=edge[i].nxt)
{
if(edge[i].w&&h[u]==h[edge[i].v]+1)
{
break;
}
}
if(i!=-1)
{
curedge[u]=i;
pre[edge[i].v]=u;
u=edge[i].v;
}
else
{
if(0==--numh[h[u]])
break;
curedge[u]=head[u];
for(tmp=n,i=head[u];i!=-1;i=edge[i].nxt)
{
if(edge[i].w)
{
tmp=min(tmp,h[edge[i].v]);
}
}
h[u]=tmp+1;
++numh[h[u]];
if(u!=s)
u=pre[u];
}
}
return flow_ans;
}
int score[maxn],num[maxn];
int mapp[maxn][maxn];
int main ()
{
int n;
while(~scanf("%d",&n))
{
memset(head,-1,sizeof(head));
cnt=0;
memset(num,0,sizeof(num));
memset(mapp,0,sizeof(mapp));
memset(score,0,sizeof(score));
for(int i=1;i<=n;i++)
{
scanf("%d",&score[i]);
}
for(int i=1;i<=n;i++)
{
scanf("%d",&num[i]);
}
int flag=0;
for(int i=2;i<=n;i++)
{
if(score[1]+num[1]<score[i])
{
flag=1;
break;
}
}
int ans=0,sum=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
scanf("%d",&mapp[i][j]);
if(i==j)
continue;
if(i<j)
continue;
if(i==1||j==1)
continue;
if(mapp[i][j]==0)
continue;
++ans;
sum+=mapp[i][j];
}
}
int s=ans+n+1;
int anss=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(mapp[i][j]==0||i==1||j==1||i<=j)
continue;
++anss;
add_edge(s,anss,mapp[i][j]);
//printf("%d %d %d\n",s,anss,mapp[i][j]);
add_edge(anss,i+ans,mapp[i][j]);
//printf("%d %d %d\n",anss,i+ans,mapp[i][j]);
add_edge(anss,j+ans,mapp[i][j]);
//("%d %d %d\n",anss,j+ans,mapp[i][j]);
}
}
if(flag==1)
{
printf("NO\n");
}
else
{
for(int i=ans+2;i<=ans+n;i++)
{
add_edge(i,s+1,score[1]+num[1]-score[i-ans]);
//printf("%d %d %d\n",i,s+1,score[1]+num[1]-score[i-ans]);
}
int res=sap(s,s+1,s+1);
// printf("%d %d\n",s,s+1);
//printf("%d %d\n",sum,res);
if(res==sum)
{
printf("YES\n");
}
else
{
printf("NO\n");
}
}
}
}