#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int N, M;
const int INF = 0x3f3f3f3f;
int w[205][205];
int lx[205], ly[205];
int sx[205], sy[205];
int match[205], slack[205];
int path(int u) {
sx[u] = 1;
for (int i = 1; i <= N; ++i) {
if (sy[i]) continue;
int t = lx[u] + ly[i] - w[u][i];
if (!t) {
sy[i] = 1;
if (!match[i] || path(match[i])) {
match[i] = u;
return true;
}
} else {
slack[i] = min(slack[i], t);
}
}
return false;
}
void KM() {
memset(match, 0, sizeof (match));
memset(lx, 0x80, sizeof (lx));
memset(ly, 0, sizeof (ly));
for (int i = 1; i <= N; ++i) {
for (int j = 1; j <= N; ++j) {
lx[i] = max(lx[i], w[i][j]);
}
}
for (int i = 1; i <= N; ++i) {
memset(slack, 0x3f, sizeof (slack));
while (1) {
memset(sx, 0, sizeof (sx));
memset(sy, 0, sizeof (sy));
if (path(i)) break;
int d = INF;
for (int j = 1; j <= N; ++j) {
if (!sy[j]) d = min(d, slack[j]);
}
for (int j = 1; j <= N; ++j) {
if (sx[j]) lx[j] -= d;
if (sy[j]) ly[j] += d;
else slack[j] -= d;
}
}
}
int ret = 0;
for (int i = 1; i <= N; ++i) {
ret += w[match[i]][i];
}
printf("%d\n", -ret);
}
int main() {
int T, x, y, ct;
scanf("%d", &T);
while (T--) {
scanf("%d %d", &N, &M);
memset(w, 0x80, sizeof (w));
for (int i = 1; i <= M; ++i) {
scanf("%d %d %d", &x, &y, &ct);
w[x][y] = max(w[x][y], -ct);
}
KM();
}
return 0;
}
tjut 3488
最新推荐文章于 2016-08-31 17:14:15 发布