思路
比较裸的这种题把。
把m个区域拆点,每个区域拆成两个点。0表示超级源点,
[
1
,
n
]
[1,n]
[1,n]表示蜡烛,
[
n
+
1
,
n
+
m
]
[n+1,n+m]
[n+1,n+m]表示m个区域的左边的点,
[
n
+
m
+
1
,
n
+
m
+
m
]
[n+m+1,n+m+m]
[n+m+1,n+m+m]表示m个区域的右边的点,n+m+m+1为超级汇点。建边如下:
①源点向N个蜡烛建边,容量为1,花费为0
②m个区域的右边的点向汇点建边,容量为1,花费为0。
③ i 蜡烛可以插在 a 区域,那么 i 蜡烛向 a 区域左点建边,容量为1,花费为0。
④同区域的两个点之间建边,容量为 n ,该条边有一个费用系数
x
x
x,表示该边流量为x时,费用为
x
2
x^2
x2
对于第四种类型的边,我们需要按照下图方式拆边即可。
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
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) {}
};
struct MCMF
{
int n, m; //结点数,边数(包括反向弧),源点s,汇点t
vector<Edge> edges; //边表。edges[e]和edges[e^1]互为反向弧
vector<int> G[MAXN]; //邻接表,G[i][j]表示结点i的第j条边在edges数组中的序号
bool inq[MAXN]; //是否在队列中
int d[MAXN]; //Bellman-Ford
int p[MAXN]; //上一条弧
int a[MAXN]; //可改进量
void init(int n)
{
this->n = n;
edges.clear();
for (int i = 0; i <= n; i++) G[i].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));
m = edges.size();
G[from].push_back(m - 2);
G[to].push_back(m - 1);
}
bool BellmanFord(int s, int t, int &flow, long long& cost)//SPFA
{
for (int i = 0; i <= n; i++) d[i] = INF;
memset(inq, 0, sizeof(inq));
d[s] = 0; inq[s] = true; 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] = true; }
}
}
}
if (d[t] == INF) return false;
flow += a[t];
cost += (long long)d[t] * (long long)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, long long& cost)
{
int flow = 0; cost = 0;
while (BellmanFord(s, t, flow, cost));
return flow;
}
}gao;
int main()
{
int n, m; scanf("%d%d", &n, &m);
int s = 0, t = n+m+m+1;
gao.init(t);
for (int i = 1; i <= n; i++)
{
int a, b; scanf("%d%d", &a, &b);
gao.AddEdge(s, i, 1, 0);
gao.AddEdge(i, a+n, 1, 0);
gao.AddEdge(i, b+n, 1, 0);
}
for (int i = n+1; i <= n+m; i++)
{
for (int j = 1; j <= n; j++)//拆边
gao.AddEdge(i, i+m, 1, j*j-(j-1)*(j-1));
gao.AddEdge(i+m, t, n, 0);
}
long long cost;
int MF = gao.MinCostMaxFlow(s, t, cost);
printf("%lld\n", cost);
return 0;
}
/*
3 3
1 2
1 2
1 2
*/