https://vjudge.net/problem/Gym-101667J
难题,思路:https://acrazyczy.github.io/2018/01/16/Daejeon-2017-J/
#include<bits/stdc++.h>
using namespace std;
const int maxn=220;
typedef long long ll;
const int INF=0x3f3f3f3f;
struct Edge{
int from,to,cap,flow;
};
struct Dinic{
int n,m,s,t;
vector<Edge> edges;
vector<int> G[maxn];
bool vis[maxn];
int d[maxn];
int cur[maxn];
void init()
{
edges.clear();
for(int i=1;i<=2*n;i++)G[i].clear();
}
void AddEdge(int f,int t,int c)
{
edges.push_back((Edge){
f,t,c,0})