DP Codeforces Round #322 (Div. 2) F. Zublicanes and Mumocrates

#include 
using namespace std;
typedef long long LL;

const int maxn = 5005;
const int maxm = 10005;
const int INF = 0x3f3f3f3f;

struct Edge
{
	int v;
	Edge *next;
}E[maxm], *H[maxn], *edges;

int dp[maxn][2][maxn];
int size[maxn];
int c[2][maxn];
int lef[maxn];
int du[maxn];
int n;

void addedges(int u, int v)
{
	edges->v = v;
	edges->next = H[u];
	H[u] = edges++;
}

void init()
{
	edges = E;
	memset(H, 0, sizeof H);
	memset(dp, INF, sizeof dp);
}

void debug(int u)
{
	printf("*************************** %dn", u);
	for(int i = 0; i next) if(e->v != fa) {
		int v = e->v;
		dfs(v, u);
		
		for(int i = 0; i