mhlwsk的博客

这题可以作为网络流模板看，这里贴一下自己的dinic模板#include <iostream> #include <algorithm> #include <cstring> #include <queue> #include <cstdio> using namespace std; const int inf=0x3fffffff,N=400,M=500; int d[N],head[N],ve

Description FJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set of paths of various lengths runs among the cows and the milki

Description 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.