自个设个源点S,汇点T,每个点 du[i]=入度-出度。
du[i]>0时 加边S->i,边权为du[i]
du[i]<0时 加边i->T,边权为 -du[i]
设sum为所有>0的du[i]的和
求S->T的最大流,如果maxflow==sum,则存在可行流,此时每条边流掉的流量+它原本的下界就是实际的流量
dfs过程中某个点可能被多次访问,这个点的某些表可能在其他地方走过了,当前弧优化就可以略过这种边
#include<bits/stdc++.h>
using namespace std;
#define INF (1e18)
typedef long long ll;
const ll maxn=205,maxm=50205;
ll n,m,S,T,sum,cnt;
ll l[maxm],head[maxn];//注意l是maxm
struct node{
ll to,ne,w;
}e[maxm];
void add(ll u,ll v,ll w){
e[cnt]=(node){v,head[u],w};head[u]=cnt++;
e[cnt]=(node){u,head[v],0};head[v]=cnt++;
}
queue<ll>q;
ll d[maxn];
ll cur[maxn];
ll bfs(){
while(!q.empty()) q.pop();
memset(d,0,sizeof(d));
memcpy(cur,head,sizeof(head));
d[S]=1;q.push(S);
while(!q.empty()){
ll u=q.front();q.pop();
if(u==T) break;
for(ll i=head[u];~i;i=e[i].ne){
ll v=e[i].to;
if(!e[i].w) continue;
if(!d[v]) d[v]=d[u]+1,q.push(v);
}
}
return d[T];
}
ll dfs(ll u,ll remain){
if(u==T) return remain;
ll use=0;
for(ll i=cur[u];~i;i=e[i].ne){
cur[u]=i;
ll v=e[i].to;
if(e[i].w&&remain&&d[v]==d[u]+1){
ll flow=dfs(v,min(remain-use,e[i].w));
if(!flow) continue;
use+=flow;
e[i].w-=flow;e[i^1].w+=flow;
if(use==remain) break;
}
}
if(!use) d[u]=-1;
return use;
}
ll dinic(){
ll ans=0,tmp;
while(bfs()){
while(tmp=dfs(S,INF)){
ans+=tmp;
}
}
return ans;
}
ll du[maxn];
int main(){
while(~scanf("%lld%lld",&n,&m)){
cnt=sum=0;
memset(head,-1,sizeof(head));
memset(du,0,sizeof(du));
S=n+1;T=S+1;
for(ll i=1;i<=m;i++){
ll u,v,r;
scanf("%lld%lld%lld%lld",&u,&v,&l[i],&r);
du[v]+=l[i];du[u]-=l[i];
add(u,v,r-l[i]);
}
for(ll i=1;i<=n;i++){
if(du[i]>0) add(S,i,du[i]),sum+=du[i];
else if(du[i]<0)add(i,T,-du[i]);
}
ll tmp=dinic();
if(tmp!=sum) printf("NO\n");
else{
printf("YES\n");
for(ll i=1;i<2*m;i+=2){
printf("%lld\n",e[i].w+l[i/2+1]);
}
}
}
return 0;
}