传送门
题目描述
题意大概就是给定 n n n 个城市, m m m 条边。 然后人只能从走相邻边相连的城市。 现在给你初始城市的每一个人数,再给一组每个城市人数。询问是否可以从当前人数变换到给定人数。如果能,输入“YES”并输出方案,不能则输出“NO”。
分析
我们去把每一个点拆成一个入点和一个出点,源点到入点连一条容量为
a
i
a_{i}
ai的边,出点到汇点连一条容量是
b
i
b_{i}
bi的边,然后每个点的入点和出点连一条容量为
i
n
f
inf
inf的边,相连的两个星球之间连边,求最大流即可
最后需要注意前后人数是否相等
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod= 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a){char c=getchar();T x=0,f=1;while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c)){x=(x<<1)+(x<<3)+c-'0';c=getchar();}a=f*x;}
int gcd(int a,int b){return (b>0)?gcd(b,a%b):a;}
int n,m,S,T;
int h[N],ne[N],e[N],f[N],idx;
int q[N], d[N], cur[N];
int ans[200][200];
int a[N],b[N];
void add(int x,int y,int z){
e[idx] = y,ne[idx] = h[x],f[idx] = z,h[x] = idx++;
e[idx] = x,ne[idx] = h[y],f[idx] = 0,h[y] = idx++;
}
bool bfs(){
int hh = 0, tt = 0;
memset(d,-1,sizeof d);
q[0] = S, d[S] = 0, cur[S] = h[S];
while(hh <= tt){
int t = q[hh ++ ];
for(int i = h[t];~i;i = ne[i]){
int j = e[i];
if(d[j] == -1 && f[i]){
d[j] = d[t] + 1;
cur[j] = h[j];
if(j == T) return true;
q[ ++ tt] = j;
}
}
}
return false;
}
int find(int u,int limit){
if(u == T) return limit;
int flow = 0;
for(int i = cur[u];~i && flow < limit;i = ne[i]){
cur[u] = i;
int j = e[i];
if(d[j] == d[u] + 1 && f[i]){
int t = find(j,min(f[i],limit - flow));
if(!t) d[j] = -1;
f[i] -= t,f[i ^ 1] +=t,flow += t;
}
}
return flow;
}
int dinic(){
int res = 0,flow;
while(bfs()) while(flow = find(S,INF)) res += flow;
return res;
}
int main(){
read(n),read(m);
memset(h,-1,sizeof h);
int sum = 0;
for(int i = 1;i <= n;i++) {
read(a[i]);
sum += a[i];
}
int sum1 = 0;
for(int i = 1;i <= n;i++) {
read(b[i]);
sum1 += b[i];
}
S = 0,T = 2 * n + 1;
for(int i = 1;i <= n;i++) add(S,i,a[i]);
for(int i = 1;i <= n;i++) add(i + n,T,b[i]);
for(int i = 1;i <= n;i++) add(i,i + n,INF);
while(m--){
int a,b;
read(a),read(b);
add(a,b + n,INF),add(b,a + n,INF);
}
int res = dinic();
if(res != sum || sum != sum1){
puts("NO");
return 0;
}
puts("YES");
for(int i = 1 + n;i <= 2 * n;i++)
for(int j = h[i];~j;j = ne[j]){
int t = e[j];
if(t >= 1 && t <= n) ans[t][i - n] = f[j];
}
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++)
printf("%d ",ans[i][j]);
puts("");
}
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/