P3254 圆桌问题
题意:就是让不同的单位的员工做不同的桌子,并输出方案。
建图很好想,就不多**了。
关键是路径输出:
for(int i = 1; i <= m; i++)
{
int len = G[i].size(), flag = 0;
for(int j = 0; j < len; j++)
{
int y = G[i][j].to;
if(y != s && !G[i][j].cap)
{
if(flag) printf(" ");
flag = 1;
printf("%d", y - m);
}
}
printf("\n");
}
还有之前遇到的路径覆盖的输出:
for(int i = 1; i <= cur - 1; i++)
if(!b[i]) flag = 0, print(i), printf("\n");
void print(int x)
{
b[x] = true;
if(flag) printf(" ");
flag = 1;
printf("%d", x);
int len = G[x].size();
for(int j = 0; j < len; j++)
if(G[x][j].cap == 0 && G[x][j].to != 0)
{
print(G[x][j].to - 2000); return;
}
}
区别在于路径覆盖时,用过的点就不能再用了,递归输出。
#include<bits/stdc++.h>
using namespace std;
const int maxn = 51000;
const int INF = 0x3f3f3f3f;
int m, n, flag;
struct Node
{
int to, cap, rev;
};
vector<Node> G[maxn * 50];
int level[maxn], iter[maxn], a[maxn];
bool b[maxn];
void addedge(int from, int to, int cap)
{
G[from].push_back((Node){to, cap, G[to].size()});
G[to].push_back((Node){from, 0, G[from].size() - 1});
}
void bfs(int s)
{
memset(level, 0, sizeof(level));
queue<int> que;
level[s] = 1;
que.push(s);
while(!que.empty())
{
int v = que.front(); que.pop();
for(int i = 0; i < G[v].size(); i++){
Node &e = G[v][i];
if(e.cap > 0 && level[e.to] <= 0){
level[e.to] = level[v] + 1;
que.push(e.to);
}
}
}
}
int dfs(int v, int t, int f)
{
if(v == t) return f;
for(int &i = iter[v]; i < G[v].size(); i++)
{
Node &e = G[v][i];
if(e.cap > 0 && level[v] < level[e.to])
{
int d = dfs(e.to, t, min(f, e.cap));
if(d > 0)
{
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
int max_flow(int s, int t)
{
int flow = 0;
while(1){
bfs(s);
if(level[t] <= 0) return flow;
memset(iter, 0, sizeof(iter));
int f;
while((f = dfs(s, t , INF)) > 0) flow += f;
}
}
int main()
{
scanf("%d%d", &m, &n);
{
int s = 0, t = m + n + 1, sum = 0;
memset(b, 0, sizeof(b));
for(int i = 1; i <= m; i++)
{
scanf("%d", &a[i]);
sum += a[i];
addedge(s, i, a[i]);
}
for(int i = 1; i <= n; i++)
{
int b;
scanf("%d", &b);
addedge(i + m, t, b);
for(int j = 1; j <= m; j++) addedge(j, i + m, 1);
}
int x = max_flow(s, t);
if(x != sum) printf("0\n");
else
{
printf("1\n");
for(int i = 1; i <= m; i++)
{
int len = G[i].size(), flag = 0;
for(int j = 0; j < len; j++)
{
int y = G[i][j].to;
if(y != s && !G[i][j].cap)
{
if(flag) printf(" ");
flag = 1;
printf("%d", y - m);
}
}
printf("\n");
}
}
}
return 0;
}