POJ 3436 ACM Computer Factory (网络流)

网络流的模板为什么能这么长。。。

问题比较简单就是建图的过程比较坑。。

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <string.h>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <vector>
#include <bitset>
#include <map>
using namespace std;
typedef  long long ll;
typedef pair<ll, ll> pii;

#define sp system("pause")
const int MAXN = 100010;
const int MAXM = 400010;

const int INF = 0x3f3f3f3f;

struct Edge
{
	int to, next, cap, flow;
}edge[MAXM];

int tol;
int head[MAXN];
int gap[MAXN], dep[MAXN], pre[MAXN], cur[MAXN];
int com[100][100];
void init()
{
	tol = 0;
	memset(head, -1, sizeof head);
	memset(com, 0, sizeof com);
}

void addedge(int u, int v, int w, int rw = 0)
{
	edge[tol].flow = 0; edge[tol].to = v; edge[tol].cap = w; edge[tol].next = head[u]; head[u] = tol++;
	edge[tol].flow = 0; edge[tol].to = u; edge[tol].cap = rw; edge[tol].next = head[v]; head[v] = tol++;
}

int sap(int start, int en, int N)
{
	memset(gap, 0, sizeof gap);
	memset(dep, 0, sizeof dep);
	memcpy(cur, head, sizeof head);
	int u = start;
	pre[u] = -1;
	gap[u] = N;
	int ans = 0;
	while (dep[start] < N)
	{
		if (u == en)
		{
			int Min = INF;
			for (int i = pre[u]; i != -1; i = pre[edge[i ^ 1].to])
				Min = min(Min, edge[i].cap - edge[i].flow);
			for (int i = pre[u]; i != -1; i = pre[edge[i ^ 1].to])
			{
				com[edge[i^1].to][edge[i].to] += Min;
				edge[i].flow += Min;
				edge[i ^ 1].flow -= Min;
			}
			u = start;
			ans += Min;
			continue;
		}
		bool flag = false;
		int v;
		for (int i = cur[u]; i != -1; i = edge[i].next)
		{
			v = edge[i].to;
			if (edge[i].cap - edge[i].flow&&dep[v] + 1 == dep[u])
			{
				flag = true;
				cur[u] = pre[v] = i;
				break;
			}
		}
		if (flag)
		{
			u = v;
			continue;
		}
		int Min = N;
		for (int i = head[u]; i != -1; i = edge[i].next)
		{
			if (edge[i].cap - edge[i].flow&&dep[edge[i].to] < Min)
			{
				Min = dep[edge[i].to];
				cur[u] = i;
			}
		}
		gap[dep[u]]--;
		if (!gap[dep[u]])return ans;
		dep[u] = Min + 1;
		gap[dep[u]]++;
		if (u != start)u = edge[pre[u] ^ 1].to;
	}
	return ans;
}

int g[100][30];

int main()
{
	int p, n;
	while (scanf("%d%d", &p, &n) != EOF)
	{
		init();
		for (int i = 0; i < n; i++)
		{
			int cap; scanf("%d", &cap);
			addedge(i * 2, 2 * i + 1, cap);
			for (int j = 0; j < 2 * p; j++)
				scanf("%d", &g[i][j]);
			for (int j = 0; j < i; j++)
			{
				int flag = 1;
				for (int k = 0; k < p; k++)
				if (g[j][k + p] == 0 && g[i][k] == 1 || (g[j][k + p] == 1 && g[i][k] == 0))flag = 0;
				if (flag)addedge(2 * j + 1, 2 * i, INF);
				flag = 1;
				for (int k = p; k < 2 * p; k++)
				if (g[i][k] == 1 && g[j][k - p] == 0 || (g[i][k] == 0 && g[j][k - p] == 1))flag = 0;
				if (flag)addedge(2 * i + 1, 2 * j, INF);
			}
			int fl = 1;
			for (int j = 0; j < p; j++)if (g[i][j] == 1)fl = 0;
			if (fl)addedge(2*n, 2 * i, INF);
			fl = 1;
			for (int j = p; j < 2 * p; j++)if (g[i][j] != 1)fl = 0;
			if (fl)addedge(2 * i + 1, 2 * n + 1, INF);
		}
		sap(2 * n, 2 * n + 1, 2 * (n + 1));
		int cot = 0; int an = 0;
		for (int i = 1; i < 2 * n; i += 2)
		{
			for (int j = 0; j < 2 * n; j += 2)
			if (com[i][j])cot++;
		}
		for (int i = 1; i < 2 * n; i += 2)
			an += com[i][2 * n + 1];
		printf("%d %d\n", an, cot);
		for (int i = 1; i < 2 * n; i += 2)
		{
			for (int j = 0; j < 2 * n; j += 2)
			if (com[i][j])printf("%d %d %d\n", i / 2 + 1, j / 2 + 1, com[i][j]);
		}
	}
	//sp;
}