toj1050二分匹配

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <climits>
#include <vector>
#include <queue>
using namespace std;

const int INF = INT_MAX>>1;
const int MAX_V = 512;

struct edge {int to, cap, rev;};
vector<edge> G[MAX_V];
int level[MAX_V];
int iter[MAX_V];
int P, N, all;

inline void add(int s, int t, int cap = 1) {
	G[s].push_back((edge){t, cap, G[t].size()});
	G[t].push_back((edge){s, 0, G[s].size()-1});
	//return
}

bool bfs(int s, int t) {
	memset(level, -1, sizeof(level));
	queue<int> Q;
	int p;

	Q.push(s);
	level[s] = 0;
	while (!Q.empty()) {
		p = Q.front();
		Q.pop();
		for (int i = 0; i < G[p].size(); ++i) {
			edge &e = G[p][i];
			if (e.cap > 0 && level[e.to] < 0) {
				level[e.to] = level[p] + 1;
				Q.push(e.to);
				if (e.to == t) return true;
			}
		}
	}
	return false;
}

int dfs(int s, int t, int flow) {
	if (s == t) return flow;
	int res = 0, d;
	for (int &i = iter[s]; i < G[s].size(); ++i) {
		edge &e = G[s][i];
		if (e.cap > 0 && level[e.to] == level[s] + 1) {
			d = dfs(e.to, t, min(flow, e.cap));
			res += d, flow -= d, e.cap -= d;
			G[e.to][e.rev].cap += d;
		}
	}
	return res;
}

int dinic(int s, int t) {
	int flow = 0;
	while (bfs(s, t)) {
		memset(iter, 0, sizeof(iter));
		flow += dfs(s, t, INF);
	}
	return flow;
}

int main() {
	int T;
	scanf(" %d", &T);
	while (T--) {
		scanf(" %d %d", &P, &N);
		all = P + N + 1; //超级汇点,0是超级源点
		for (int i = 0; i < MAX_V; ++i) G[i].clear();

		int m, a;
		for (int i = 1; i <= P; ++i) {
			scanf(" %d", &m);
			add(0, i);
			for (int j = 1; j <= m; ++j) {
				scanf(" %d", &a);
				add(i, P+a);
			}
		}
		for (int i = 1; i <= N; ++i) add(P+i, all);

		puts(dinic(0,all)==P ? "YES" : "NO");
	}
	return 0;
}

呃呃呃,还是用最大流处理,但是建图上比上一篇做了些优化.源点和超级源点的边容量设为1,汇点和超级汇点也是1,这样可以省去拆点上的麻烦了.所以建图上可以精简一下...其它没的说了.主要是习惯了dinic,以后就一直用它好了.二分匹配也用它搞吧.记性不好,记一个算法总比记两个好.