uvalive2957

刘汝佳的例题题p358。(训练指南）

那个什么抵消的意思就是：如有边1-3 3-4 2-3 2-4 1-2

s=1 t=4 k=2 有可能增广后是1-2-3-4 和1-3-2-4这2条路径那么我们看成 1-3-4与1-2-4

分析就见刘汝佳咯。。。。

还有打印点的时候就是，先让每个计算机在原点然后时间记录是0，然后沿着有流的边一个一个转移就好了，还有就是点的换算注意一下

你测试这几组数据，过了在换算方面就木问题了：其实在virtual judge上有个debug。。。里面有些数据阔用

2 1 7 1 2

1 2

3 2 1 1 3

1 2

2 3

#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
pair<int, int>p[300];
struct edgee
{
	int from, to, cap;
};
struct position 
{
	int now, time;
};
edgee edge[3000000];
int first[10000], nextt[3000000],d[10000],change[10000];
position pos[100];
vector<edgee>show[100];
int edgetot = 0;
int n, m, k, s, t;
void addedge(int from, int to, int cap)
{
	edge[edgetot].to = to;
	edge[edgetot].cap = cap;
	edge[edgetot].from = from;
	nextt[edgetot] = first[from];
	first[from] = edgetot;
	edgetot++;
	edge[edgetot].to = from;
	edge[edgetot].cap = 0;
	edge[edgetot].from = to;
	nextt[edgetot] = first[to];
	first[to] = edgetot;
	edgetot++;
}
bool bfs(int s,int day,int t)
{
	queue<int>que;
	for (int i = 1; i <= (day + 1)*n; i++)d[i] = -1;
	d[s] = 0;
	que.push(s);
	while (!que.empty())
	{
		int temp = que.front();
		if (temp == t)return true;
		que.pop();
		for (int i = first[temp]; i != -1; i = nextt[i])
		{
			int to = edge[i].to;
			if (d[to] ==-1&& edge[i].cap)
			{
				d[to] = d[temp] + 1;
				que.push(to);
			}
		}
	}
	return false;
}
int dfs(int x, int t, int flow)
{
	if (x == t||flow==0)
	{
		return flow;
	}
	int all = 0;
	for (int &i = change[x]; i != -1; i = nextt[i])
	{
		int to = edge[i].to;
		if (d[to] == d[x] + 1 && edge[i].cap)
		{
			int fflow = 0;
			fflow += dfs(to, t, min(edge[i].cap, flow));
			flow -= fflow; all += fflow;
			edge[i].cap -= fflow; edge[i ^ 1].cap += fflow;
			if (flow == 0)break;
		}
	}
	if (all == 0)d[x] = -1;
	return all;
}
int dicnic(int s, int t, int k, int day)
{
	int flow = 0;
	while (bfs(s, day, t) && k)
	{
		int fflow = 0;
		for (int i = 0; i <= (day + 1)*n; i++)change[i] = first[i];
		fflow=dfs(s, t, k);
		k -= fflow; flow += fflow;
	}
	return flow;
}
int c(int k)//这个地方是本题易错点！！！！！
{
	return k%n == 0 ? n : k%n;
}
int low(int k)//这个地方是本题易错点！！！
{
	return k%n == 0 ? k / n - 1 : k / n;
}
int main()
{
	while (scanf("%d%d%d%d%d", &n, &m, &k, &s, &t)!=EOF)
	{
		int tempk = k;
		int day = 0;
		edgetot = 0;
		for (int i = 1; i <= 60 * n; i++)first[i] = -1;
		
		for (int i = 0; i <= 50; i++)show[i].clear();
		for (int i = 0; i < m; i++)
		{
			int a, b;
			scanf("%d%d", &a, &b);
			p[i].first = a; p[i].second = b;
		}
		while (k)
		{
			day++;
			for (int i = 0; i < m; i++)
			{
				addedge(p[i].first + (day - 1)*n, p[i].second + day*n, 1);
				addedge(p[i].second + (day - 1)*n, p[i].first + day*n, 1);
				addedge(p[i].first + (day - 1)*n, p[i].first + day*n, 1000000000);
				addedge(p[i].second + (day - 1)*n, p[i].second + day*n, 1000000000);
			}
			int flow = dicnic(s, t+day*n, k,day);
			k -= flow;
		}
		for (int i = 0; i < edgetot; i += 8)
		{
			int from = c(edge[i].from); int to = c(edge[i].to);
			if (edge[i^1].cap&&!edge[(i + 2)^1].cap)
			{
				show[low(edge[i].from)].push_back(edge[i]);
			}
			if (!edge[i^1].cap&&edge[(i + 2)^1].cap)
			{
				show[low(edge[i].from)].push_back(edge[i + 2]);
			}
		}
		for (int i = 1; i <= tempk; i++)pos[i].now = s, pos[i].time = 0;
		printf("%d\n", day);
		for (int i = 0; i < day; i++)
		{
			if (!show[i].size())continue;
			printf("%d", show[i].size());
			for (int j = 0; j < show[i].size(); j++)
			{
				int to = c(show[i][j].to); int from = c(show[i][j].from);
				for (int p = 1; p <= tempk; p++)
				{
					if (pos[p].now == from&&pos[p].time <= i)
					{
						printf(" %d %d", p, to);
						pos[p].time = i + 1; pos[p].now = to;
						break;
					}
				}
			}
			printf("\n");
		}
	}
	return 0;
}