网络流Dinic

#include<iostream>
#include<stdio.h>
#include<vector>
#include<queue>
#include<string.h>
#define clr(p)  memset(p,0,sizeof(p))
using namespace std;
int n,m;
struct Edge{
    int from,to,cap,flow;
    Edge(int x,int y,int v,int now)
    {
        from=x,to=y,cap=v,flow=now;
    }Edge(){}
};
vector<Edge> edge;
vector<int> G[205];
int en,st;
int tot=0;
int d[205];
int INF=10000009;
void add(int a,int b,int v)
{
    edge.push_back(Edge(a,b,v,0));
    edge.push_back(Edge(b,a,0,0));
    G[a].push_back(tot++);
    G[b].push_back(tot++);
}
bool bfs()
{