题目链接:https://nanti.jisuanke.com/t/31447
代码是写出来了,但为什么这样建图还有待理解
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 20005;
const int MAXM = 110000;
const int INF = 0x3f3f3f3f;
struct Edge1
{
int from,to,cap,flow;
};
struct Dinic
{
int n,m,s,t;
vector<Edge1> edges;
vector<int> G[MAXN];
bool vis[MAXN];
int d[MAXN];
int cur[MAXN];
void init(int n)
{
this -> n = n;
for(int i = 0; i <= n + 1; i++){
G[i].clear();
}
edges.clear();
}
void AddEdge(int from,int to,int cap)
{
edges.push_back((Edge1){from,to,cap,0});
edges.push_back((Edge1){to,from,0,0});
m = edges.size();
G[from].push_back(m - 2);
G[to].push_back(m - 1);
}
bool BFS()
{
memset(vis,0,sizeof(vis));
queue<int> Q;
Q.push(s);
d[s] = 0;
vis[s] = 1;
while(!Q.empty()) {
int x = Q.front();
Q.pop();
for(int i = 0; i < G[x].size(); i++) {
Edge1& e = edges[G[x][i]];
if(!vis[e.to] && e.cap > e.flow) {
vis[e.to] = 1;
d[e.to] = d[x] + 1;
Q.push(e.to);
}
}
}
return vis[t];
}
int DFS(int x,int a)
{
if(x == t || a == 0) return a;
int flow = 0,f;
for(int& i = cur[x]; i < G[x].size(); i++) {
Edge1& e = edges[G[x][i]];
if(d[x] + 1 == d[e.to] && (f = DFS(e.to,min(a,e.cap - e.flow))) > 0) {
e.flow += f;
edges[G[x][i] ^ 1].flow -= f;
flow += f;
a -= f;
if(a == 0) break;
}
}
return flow;
}
int Maxflow(int s,int t) {
this -> s = s,this -> t = t;
int flow = 0;
while(BFS()) {
memset(cur,0,sizeof(cur));
flow += DFS(s,INF);
}
return flow;
}
}din;
int S,T;
void add(int u,int v,int low,int high)
{
din.AddEdge(u,v,high - low);
din.AddEdge(S,v,low);
din.AddEdge(u,T,low);
}
bool check()
{
for(int i = 0; i < din.edges.size(); i++) {
Edge1 e = din.edges[i];
//printf("%d %d\n",e.flow,e.cap);
if( (e.from == S || e.to == T) && e.flow != e.cap) return false;
}
return true;
}
int main(void)
{
int n,m,k,u,v;
int L,R,kase;
kase = 0;
while(scanf("%d %d %d",&n,&m,&k) != EOF) {
kase++;
scanf("%d %d",&L,&R);
din.init(MAXN);
S = (n + m + 2);
T = (m + m + 3);
for(int i = 1; i <= n; i++) add(0,i,L,R);
for(int i = n + 1; i <= n + m; i++) add(i,n + m + 1,L,R);
while(k--) {
scanf("%d %d",&u,&v);
din.AddEdge(u,v + n,1);
}
din.AddEdge(n + m + 1,0,INF);
din.Maxflow(S,T);
if(check()) printf("Case %d: Yes\n",kase);
else printf("Case %d: No\n",kase);
}
return 0;
}