/*最小生成树*/
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <cctype>
#include <map>
#include <set>
#include <bitset>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <limits>
#include <fstream>
using namespace std;
#define mem(A, X) memset(A, X, sizeof A)
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define foreach(e,x) for(__typeof(x.begin()) e=x.begin();e!=x.end();++e)
#define sz(x) (int)((x).size())
#define sl(a) strlen(a)
#define rep(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#define Rep(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define dbg(a) cout << a << endl;
#define fi first
#define se second
/*typedef long long int64;
inline int nextInt() { int x; scanf("%d", &x); return x; }
inline int64 nextI64() { int64 d; cin >> d; return d; }
inline char nextChr() { scanf(" "); return getchar(); }
inline string nextStr() { string s; cin >> s; return s; }
inline double nextDbf() { double x; scanf("%lf", &x); return x; }
inline int64 nextlld() { int64 d; scanf("%lld", &d); return d; }
inline int64 next64d() { int64 d; scanf("%I64d", &d); return d; }
int gcd(const int64 &a, const int64 &b) { return b == 0 ? a : gcd(b, a % b); }
int64 int64pow(int64 a, int64 b){ if (b == 0) return 1; int64 t = int64pow(a, b / 2); if (b % 2) return t * t * a; return t * t; }
const int inf = 1 << 30;
const double eps = 1e-8;
const double pi = acos(-1.0);*/
const int MAX_N = 3005;
int T, cas = 0, n, len, sum;
int fa[MAX_N];
struct edge {
int u, v, cost;
edge(int u = 0, int v = 0, int cost = 0) :u(u), v(v), cost(cost){}
};
edge e[MAX_N];
bool cmp(const edge &s1, const edge &s2)
{
return s1.cost < s2.cost;
}
void MakeSet()
{
Rep(i, 1, n)
fa[i] = i;
}
int GetFather(int x)
{
if (x == fa[x])
return x;
else
return fa[x] = GetFather(fa[x]);
}
void init()
{
len = 1;
sum = 0;
int tmp;
Rep(i, 1, n) {
Rep(j, 1, n) {
cin >> tmp;
if (i == j) {
sum += tmp;
continue;
}
else if (tmp == 0)
continue;
else {
e[len].u = i;
e[len].v = j;
e[len].cost = tmp;
sum += tmp;
++len;
}
}
}
--len;
//dbg(len);
}
void solve()
{
if (n == 1) {
cout << "Case " << ++cas << ": " << sum << endl;
return;
}
MakeSet();
sort(e + 1, e + len + 1, cmp);
int tmpans = 0, cnt = 0;
Rep(i, 1, len) {
int t1 = GetFather(e[i].u);
int t2 = GetFather(e[i].v);
if (t1 != t2) {
fa[t1] = t2;
tmpans += e[i].cost;
++cnt;
}
}
if (cnt != n - 1) {
cout << "Case " << ++cas << ": " << "-1" << endl;
return;
}
//dbg(tmpans);
sum -= tmpans;
//dbg(sum);
cout << "Case " << ++cas << ": " << sum << endl;
}
int main()
{
cin >> T;
while (cin >> n) {
init();
solve();
}
return 0;
}
LightOj 1040 - Donation
最新推荐文章于 2019-08-12 10:25:28 发布