-
Notifications
You must be signed in to change notification settings - Fork 2
/
agrinet.cpp
66 lines (60 loc) · 1.68 KB
/
agrinet.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
/*
ID: sireric1
LANG: C++11
TASK: agrinet
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
freopen("agrinet.in", "r", stdin);
freopen("agrinet.out", "w", stdout);
int N; cin >> N;
int adj[N][N];
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
cin >> adj[i][j];
}
}
bool isTree[N];
int dist[N];
int src[N];
vi graph[N];
fill(isTree, isTree+N, false);
fill(src, src+N, -1);
fill(dist, dist+N, INT_MAX);
isTree[0] = true;
int prev = 0;
int ans = 0;
for(int i = 0; i < N-1; i++){
int minN = INT_MAX;
int minidx = 0;
for(int j = 0; j < N; j++){
if(!isTree[j] && adj[prev][j] < dist[j]){
dist[j] = adj[prev][j];
src[j] = prev;
}
if(!isTree[j] && dist[j] < minN){
minN = dist[j];
minidx = j;
}
}
ans += adj[src[minidx]][minidx];
prev = minidx;
isTree[minidx] = true;
}
cout << ans << endl;
return 0;
}