hihocoder 1378（有向图求最小割集）

在最大流模板的基础上，求出最小割集

题目链接：hihocoder 1378

#include<iostream>
#include<stdio.h>
#include<math.h>
#include <string>
#include<string.h>
#include<map>
#include<queue>
#include<set>
#include<utility>
#include<vector>
#include<algorithm>
#include<stdlib.h>
using namespace std;
#define maxn 20005
#define maxm 100005
#define rd(x) scanf("%d", &x)
#define rd2(x, y) scanf("%d%d", &x, &y)

const int INF = 0x3f3f3f3f;
struct Edge{
    int to, next, cap, flow;
}edge[maxm];
int tol, head[maxn];
int gap[maxn], dep[maxn], pre[maxn], cur[maxn];
void init(){
    tol = 0;
    memset(head, -1, sizeof(head));
}
void addedge(int u, int v, int w, int rw = 0){
    edge[tol].to = v; edge[tol].cap = w; edge[tol].next &#