<span style="font-size:18px;">大意:n,m,s,e分别表示n个点,m条边,s,e是起始和结束的的点,接下来,u,v,a,b.为u到v为有向边,并且保证in[a]==out[a],
还有就是两个入点和出点,然后就是如果将这条边保留费用为a,否则为b,问从s到e的最小费用是多少。不能到达则输出impossible。
</span>
<span style="font-size:18px;">
</span>
<span style="font-size:18px;">思路:既然我们要构建费用流,在建立两两点之间的费用应该是删除当前与不删除当前边的价值差,在要删除当前边的时候反向建图,</span>
<span style="font-size:18px;">同时记录入出度++, 起始点的in[]++和终止点的out[]++,然后就是在in[i]>out[i]时建立源点到当前i点的边,
流量就是度数差,否则当前点到汇点建边。如果跑完费用流q[i].w>0那么是说度数in[]!=out[]所以输出impossible.</span>
<span style="font-size:18px;">
</span>
<span style="font-size:18px;">
</span>
<span style="font-size:18px;">
</span>
<span style="font-size:18px;"></span><pre name="code" class="cpp">#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<queue>
#define inf 0x3f3f3f3f
#define LL __int64
using namespace std;
const int N = 8000;
int sum,head[N],cost,flow,cnt;
struct node{
int to,c,w,next;
}q[N*50];
int mp[200][200],cur[N],f[N],dis[N],in[200],out[200];
int st,ed,n;
bool vis[N];
void Add(int u,int v,int cap,int cost){
q[sum].to=v;
q[sum].w=cap;
q[sum].c=cost;
q[sum].next=head[u];
head[u]=sum++;
q[sum].to=u;
q[sum].w=0;
q[sum].c=-cost;
q[sum].next=head[v];
head[v]=sum++;
}
int SPFA(){
memset(vis,false,sizeof(vis));
memset(dis,inf,sizeof(dis));
queue<int>Q;
while(!Q.empty())
Q.pop();
Q.push(st);
cur[st] = -1;
f[st] = inf;
dis[st] = 0;
while(!Q.empty()){
int u = Q.front();
Q.pop();
vis[u] = false;
for(int i = head[u];~i;i=q[i].next ){
int v = q[i].to;
if(dis[v] > dis[u] + q[i].c&&q[i].w ){
dis[v] = dis[u] + q[i].c;
cur[v] = i;
f[v] = min(f[u],q[i].w);
if(!vis[v]){
vis[v] = true;
Q.push(v);
}
}
}
}
if(dis[ed] == inf)
return 0;
flow += f[ed];
cost += f[ed]*dis[ed];
for(int i = cur[ed];~i;i = cur[q[i^1].to ]){
q[i].w -= f[ed];
q[i^1].w += f[ed];
}
return 1;
}
char str[20];
void init(){
memset(head,-1,sizeof(head));
for(int i = 0;i <= n;++ i){
in[i] = out[i] = 0;
}
sum = cost = flow = cnt = 0;
}
bool so(){
for(int i = head[st];~i;i=q[i].next){
if(q[i].w > 0) return false;
}
return true;
}
int main(){
int m,i,j,k,cla,u,v,a,b,s,e;
scanf("%d",&cla);
for(int zu = 1;zu <= cla;++ zu){
init();
scanf("%d%d%d%d",&n,&m,&s,&e);
for( i = 0;i < m;++ i ){
scanf("%d%d%d%d",&u,&v,&a,&b);
if(a > b){
Add(u,v,1,a - b);
cnt += b;
}
else{
Add(v,u,1,b - a);
in[v]++,out[u]++;
cnt += a;
}
}
in[s]++,out[e]++;
st = 0,ed = n+1;
for(i = 1;i <= n;++ i){
if(in[i] > out[i])
Add(st,i,in[i] - out[i],0 );
else
Add(i,ed,out[i] - in[i],0 );
}
while(SPFA());
printf("Case %d: ",zu);
if( !so() )
printf("impossible\n");
else{
printf("%d\n",cnt + cost);
}
}
return 0;
}