obsorb_knowledge的博客

求最大流算法dinic 2 #include // 最大流 Dinic 模版 2 #include #include using namespace std; #include #define INF 0x3f3f3f3f #include struct node { int to,cap,rev; }; vector v[300]; int n,m; int level[300];

Mirko works on a pig farm that consists of M locked pig-houses and Mirko can't unlock any pighouse because he doesn't have the keys. Customers come to the farm one after another. Each of them has keys