对于这种人与人之间互相打比赛的题,一般都是分成两种点,一种是人,一种是比赛。
本题的意思是,有一只球队,编号为1,它的老板想让球队成为分区里边的第一或者并列第一。然后给出了当前所有球队已经赢的场数,还有剩下比赛的场数,但是剩下的比赛不光包括本分区的,还可能是跟别的分区打,这一点参考NBA。然后给出一个矩阵代表本分区内每个球队互相之间还剩余的比赛场数。
那么对于1号球队,剩余的场次都赢才最有可能成为分区第一,并且别的球队只要是跟别的分区打的都输掉。然后此时1号球队全赢后的胜场已经固定了,假设为x, 那么如果别的球队现在的胜场为y,那么它最多只能再赢y-x场,否则1号球队就当不了第一。
那么这样进行建图
源点到每个球队点连边,容量为刚才的y-x,如果有y-x<0说明1号球队无法成为第一了。
球队点到跟他们相关的比赛连边,容量为两个球队还剩余的比赛数,注意1号球队不在参与连边,因为所有跟1号球队打的比赛必然会是1号球队赢。
最后比赛跟汇点连边,容量为剩余的比赛数
.
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#define eps 1e-5
#define MAXN 555
#define MAXM 55555
#define INF 100000007
using namespace std;
typedef int type;
struct node
{
int v;
type c, f;
int next, r;
}edge[MAXM];
int dist[MAXN], nm[MAXN], src, des, n;
int head[MAXN], e;
void add(int x, int y, type c)
{
edge[e].v = y;
edge[e].c = c;
edge[e].f = 0;
edge[e].r = e + 1;
edge[e].next = head[x];
head[x] = e++;
edge[e].v = x;
edge[e].c = 0;
edge[e].f = 0;
edge[e].r = e - 1;
edge[e].next = head[y];
head[y] = e++;
}
void rev_BFS()
{
int Q[MAXN], h = 0, t = 0;
for(int i = 1; i <= n; ++i)
{
dist[i] = MAXN;
nm[i] = 0;
}
Q[t++] = des;
dist[des] = 0;
nm[0] = 1;
while(h != t)
{
int v = Q[h++];
for(int i = head[v]; i != -1; i = edge[i].next)
{
if(edge[edge[i].r].c == 0 || dist[edge[i].v] < MAXN)continue;
dist[edge[i].v] = dist[v] + 1;
++nm[dist[edge[i].v]];
Q[t++] = edge[i].v;
}
}
}
void init()
{
e = 0;
memset(head, -1, sizeof(head));
}
type maxflow()
{
rev_BFS();
int u;
type total = 0;
int cur[MAXN], rpath[MAXN];
for(int i = 1; i <= n; ++i)cur[i] = head[i];
u = src;
while(dist[src] < n)
{
if(u == des) // find an augmenting path
{
type tf = INF;
for(int i = src; i != des; i = edge[cur[i]].v)
tf = min(tf, edge[cur[i]].c);
for(int i = src; i != des; i = edge[cur[i]].v)
{
edge[cur[i]].c -= tf;
edge[edge[cur[i]].r].c += tf;
edge[cur[i]].f += tf;
edge[edge[cur[i]].r].f -= tf;
}
total += tf;
u = src;
}
int i;
for(i = cur[u]; i != -1; i = edge[i].next)
if(edge[i].c > 0 && dist[u] == dist[edge[i].v] + 1)break;
if(i != -1) // find an admissible arc, then Advance
{
cur[u] = i;
rpath[edge[i].v] = edge[i].r;
u = edge[i].v;
}
else // no admissible arc, then relabel this vtex
{
if(0 == (--nm[dist[u]]))break; // GAP cut, Important!
cur[u] = head[u];
int mindist = n;
for(int j = head[u]; j != -1; j = edge[j].next)
if(edge[j].c > 0)mindist = min(mindist, dist[edge[j].v]);
dist[u] = mindist + 1;
++nm[dist[u]];
if(u != src)
u = edge[rpath[u]].v; // Backtrack
}
}
return total;
}
int id[33][33], val[33], t[33][33];
int nt, m;
int main()
{
int w;
while(scanf("%d", &nt) != EOF)
{
for(int i = 1; i <= nt; i++) scanf("%d", &val[i]);
scanf("%d", &w);
val[1] += w;
for(int i = 1; i < nt; i++) scanf("%d", &w);
m = 0;
int sum = 0;
for(int i = 1; i <= nt; i++)
for(int j = 1; j <= nt; j++)
{
scanf("%d", &t[i][j]);
if(i > 1 && i < j && t[i][j])
{
m++;
id[i][j] = m + nt;
sum += t[i][j];
}
}
init();
src = m + nt + 1;
des = m + nt + 2;
n = des;
int flag = 1;
for(int i = 2; i <= nt; i++)
{
if(val[i] > val[1]) flag = 0;
add(src, i, val[1] - val[i]);
}
for(int i = 2; i <= nt; i++)
for(int j = i + 1; j <= nt; j++)
{
if(!t[i][j]) continue;
add(i, id[i][j], t[i][j]);
add(j, id[i][j], t[i][j]);
add(id[i][j], des, t[i][j]);
}
if(flag && maxflow() == sum) printf("YES\n");
else printf("NO\n");
}
return 0;
}