-
Notifications
You must be signed in to change notification settings - Fork 3
/
lightoj 1040.cpp
132 lines (98 loc) · 2.49 KB
/
lightoj 1040.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
///***Bismillahir Rahmanir Rahim***///
///*********************************///
///******Ashraful Haque Toni********///
///********Dept. of CSE,JnU*********///
///email:[email protected]///
///*******contact:01640690531*******///
///*********************************///
#include<bits/stdc++.h>
using namespace std;
#define ash ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp make_pair
#define sc(n) scanf("%d",&n);
#define scl(n) scanf("%I64d",&n);
#define sc2(m,n) scanf("%d%d",&m,&n);
#define sc2l(m,n) scanf("%I64d%I64d",&m,&n);
#define pf printf
#define Big(x,y) max(x,y);
#define Small(x,y) min(x,y);
#define input(array,size) for(int i=0;i<size;i++)cin>>array[i];
#define newline pf("\n");
#define f(s,l,in) for(ll i=s;i<l;i+=in)
#define Max INT_MAX
#define Min INT_MIN
#define pi acos(-1.0)
#define Memset(a,val) memset(a,val,sizeof(a));
const int mod =1e9+7;
const int N =5e6+5;
typedef long long ll;
int n;
vector<int>parent(55);
void initialize()
{
for(int i=0;i<55;i++)parent[i]=i;
}
int pp(int x)
{
return (x==parent[x])?x:(parent[x]=pp(parent[x]));
}
void Union(int x,int y)
{
parent[pp(x)]=parent[pp(y)];
}
int kruskal(vector<pair<int,pair<int,int> > >v)
{
int k=0;
for(int i=0;i<v.size();i++)
{
int U=v[i].second.first;
int V=v[i].second.second;
int W=v[i].first;
if(pp(U)!=pp(V)){
k+=W;
Union(U,V);
}
}
int l=pp(1);
for(int i=2;i<=n;i++){
if(pp(i)!=l)return -1;
}
return k;
}
int main()
{
ash;
int t;
cin>>t;
for(int ii=1;ii<=t;ii++)
{
//int n;
cin>>n;
vector<pair<int,pair<int,int> > >g;
int sum=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
int w;
cin>>w;
sum+=w;
if(w!=0&&i!=j){
g.pb({w,{i,j}});
}
}
}
sort(g.begin(),g.end());
initialize();
int k=kruskal(g);
cout<<"Case "<<ii<<": ";
if(k==-1){
cout<<-1<<endl;
}
else{
cout<<sum-k<<endl;
}
}
return 0;
}