Description
同一时刻有
N
位车主带着他们的爱车来到了汽车维修中心。维修中心共有
Input
第一行有两个
Output
最小平均等待时间,答案精确到小数点后 2 位。
Sample Input
2 2
3 2
1 4
Sample Output
1.50
HINT
数据范围:
Solution
啊♂费用流
把
n
和
把每个工人拆成 n 个点。记为
a[i,j] 表示第 i 个工人修倒数第j 辆车。每个车跟所有 n×m 个工人拆出的点连边。流量为 1 ,费用为
time[i,j]×k 。源和每辆车连边, n×m 个点和汇连边,流量都为 1 ,费用为
0 。
#include<bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define N 1010
#define INF 0x7fffffff
inline int read() {
int x = 0, flag = 1; char ch = getchar(); while (!isdigit(ch)) { if (!(ch ^ '-')) flag = -1; ch = getchar(); }
while (isdigit(ch)) x = (x << 1) + (x << 3) + ch - '0', ch = getchar(); return x * flag;
}
int n, m, t[61][10];
struct edge { int u, v, next, w, c; }eg[100001]; int tot = 1;
int head[N], from[N];
int ans = 0;
queue<int> q; bool inq[N];
int dis[N];
bool spfa() {
rep(i, 0, 1001) dis[i] = INF; dis[0] = 0; q.push(0), inq[0] = 1;
while(!q.empty()) {
int u = q.front(), v; q.pop(); //printf("%d\n", dis[u]);
for(int i = head[u]; i; i = eg[i].next) if(eg[i].w && dis[(v = eg[i].v)] > dis[u] + eg[i].c) {
dis[v] = dis[u] + eg[i].c, from[v] = i; if(!inq[v]) q.push(v), inq[v] = 1;
}
inq[u] = 0;
}
return dis[1001] != INF;
}
inline void update() {
int tmp = INF;
for(int i = from[1001]; i; i = from[eg[i].u]) tmp = min(tmp, eg[i].w);
for(int i = from[1001]; i; i = from[eg[i].u]) eg[i].w -= tmp, eg[i ^ 1].w += tmp, ans += eg[i].c * tmp;
}
inline void ins(int u, int v, int w, int c) { eg[++tot] = edge { u, v, head[u], w, c }; head[u] = tot; }
inline void add(int u, int v, int w, int c) { ins(u, v, w, c); ins(v, u, 0, -c); }
int main() {
// freopen("c.in", "r", stdin), freopen("c.out", "w", stdout);
n = read(), m = read(); rep(i, 1, m) rep(j, 1, n) t[i][j] = read();
rep(i, 1, n * m) add(0, i, 1, 0); rep(i, n * m + 1, n * m + m) add(i, 1001, 1, 0);
rep(i, 1, n) rep(j, 1, m) rep(k, 1, m) add(m * (i - 1) + j, k + n * m, 1, t[k][i] * j);
// rep(i, 1, tot) printf("%d %d %d %d %d\n", eg[i].u, eg[i].v, eg[i].next, eg[i].c, eg[i].w);
while(spfa()) update(); printf("%.2lf", 1.0 * ans / m); return 0;
}