HDU 5352 MZL's City（2015 多校 第5场，最小费用最大流）

MZL's City

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cmath>
#define LL long long
using namespace std;
const int maxn = 10000 + 10;
const int INF = 0x3f3f3f3f;
struct Edge
{
int from, to, cap, flow, cost;
Edge(int u, int v, int c, int f, int w) : from(u), to(v), cap(c), flow(f), cost(w) { }
};
int n;
vector<Edge>edges;
vector<int>G[maxn];
int inq[maxn];
int d[maxn];
int p[maxn];
int a[maxn];
void init()
{
for(int i=0;i<maxn;i++)
G[i].clear();
edges.clear();
}
void AddEdge(int from, int to, int cap, int cost)
{
edges.push_back(Edge(from,to,cap,0,cost));
edges.push_back(Edge(to,from,0,0,-cost));
int M = edges.size();
G[from].push_back(M-2);
G[to].push_back(M-1);
}
bool SPFA(int s, int t, int& flow, LL& cost)
{
for(int i=0;i<=n+1;i++)
d[i] = INF;
memset(inq, 0, sizeof(inq));
d[s] = 0; inq[s] = 1; p[s] = 0; a[s] = INF;
queue<int>Q;
Q.push(s);
while(!Q.empty())
{
int u = Q.front();Q.pop();
inq[u] = 0;
for(int i=0;i<G[u].size();i++)
{
Edge& e = edges[G[u][i]];
if(e.cap > e.flow && d[e.to] > d[u] + e.cost)
{
d[e.to] = d[u] + e.cost;
p[e.to] = G[u][i];
a[e.to] = min(a[u], e.cap - e.flow);
if(!inq[e.to]){Q.push(e.to);inq[e.to] = 1;}
}
}
}
if(d[t] == INF) return false;
flow += a[t];
cost += (LL) d[t] * (LL) a[t];
for(int u=t;u!=s;u=edges[p[u]].from)
{
edges[p[u]].flow += a[t];
edges[p[u]^1].flow -= a[t];
}
return true;
}
int MincostMaxflow(int s, int t, LL& cost)
{
int flow = 0; cost = 0;
while(SPFA(s,t,flow,cost));
return flow;
}
int dis[210][210], vis[210];
int N, M, K;
void dfs(int u)
{
vis[u] = 1;
for(int i=1;i<=N;i++)
{
if(!vis[i] && dis[u][i])
dfs(i);
}
}
int main()
{
int T;
scanf("%d", &T);
while(T--)
{
init();
memset(dis, 0, sizeof(dis));
scanf("%d%d%d", &N, &M, &K);
int op, x, y;
int s = 0, t = N + 1;
int tt = N + 2, COST = M + 10;
for(int i=1;i<=N;i++) AddEdge(i, t, 1, 0);
for(int i=1;i<=M;i++)
{
scanf("%d", &op);
if(op == 1)
{
memset(vis, 0, sizeof(vis));
scanf("%d", &x);
dfs(x);
AddEdge(s, tt, K, COST);
COST--;
for(int j=1;j<=N;j++) if(vis[j])
AddEdge(tt, j, 1, 0);
tt++;
}
else if(op == 2)
{
scanf("%d%d", &x, &y);
dis[x][y] = dis[y][x] = 1;
}
else
{
int e; scanf("%d", &e);
while(e--)
{
scanf("%d%d", &x, &y);
dis[x][y] = 0;
dis[y][x] = 0;
}
}
}
n = tt;
LL ans;
int flow = MincostMaxflow(s, t, ans);
printf("%d\n", flow);
int flag = 0;
for(int i=0;i<edges.size();i++)
{
if(flag == 0 && edges[i].from == s)
{
printf("%d", edges[i].flow);
flag = 1;
}
else if(edges[i].from == s)
{
printf(" %d", edges[i].flow);
}
}
printf("\n");
}
return 0;
}