Xi Lin zimpha

## POJ_3469_sap.cpp
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN=20010;
const int MAXM=600000;
const int inf=1000000000;

struct Edge {

## POJ_3057.cpp
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int SIZE=15;
const int MAXN=22500;
const int dx[]={0, -1, 1, 0};

## BZOJ_1266.cpp
#include <queue>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN=505;
const int MAXM=124755*2;
const int inf=1e9;
struct Edge {

## BZOJ_1070.cpp
#include <queue>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN=610;
const int MAXM=80000;
const int inf=1e9;

## [JSOI2010]Frozen Nova 冷冻波.cpp
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <algorithm>
using namespace std;
const int MAXN=410;
const int inf=1e9;

## [Zjoi2011]最小割.cpp
#include <vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int MAXN=150+10;
const int MAXM=3000;
const int inf=1e9;

## POJ_2711.cpp
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int MAXN=800+10;
const int SIZE=25;
const int inf=1e9;

struct Edge {

## BZOJ_2756.cpp
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
typedef long long LL;
const int MAXN=1600+10;
const int SIZE=50;
const LL inf=1ll<<50ll;

## BZOJ_1305.cpp
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int MAXN=300+10;
const int inf=1e9;

struct Edge {
	int v, cap;

## BZOJ_2561.cpp
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int MAXN=20000+10;
const int MAXM=400000+10;
const int inf=100000000;

struct node {
	#include <cstdio>
	#include <cstdlib>
	#include <cstring>
	#include <algorithm>
	using namespace std;
	const int MAXN=20010;
	const int MAXM=600000;
	const int inf=1000000000;

	struct Edge {
	#include <queue>
	#include <vector>
	#include <cstdio>
	#include <cstring>
	#include <cstdlib>
	#include <algorithm>
	using namespace std;
	const int SIZE=15;
	const int MAXN=22500;
	const int dx[]={0, -1, 1, 0};
	#include <cmath>
	#include <vector>
	#include <cstdio>
	#include <cstring>
	#include <cstdlib>
	#include <cassert>
	#include <algorithm>
	using namespace std;
	const int MAXN=410;
	const int inf=1e9;