Introduction to Programming Introduction to Algorithms and Data Structures Library of Data Structures Library of Graph Algorithms Library of Computational Geometry Library of Dynamic Programming Library of Number Theory
隣接グラフが与えれる．全ての点間を結ぶコストが最小であり，ハミルトン路を持つグラフのコストの和を答える．
Code
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
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std ;
typedef long long ll ;
typedef pair < int , int > P ;
int main () {
int n ;
cin >> n ;
ll cost [ 105 ][ 105 ];
memset ( cost , 0 , sizeof ( cost ));
rep ( i , n ) {
rep ( j , n ) cin >> cost [ i ][ j ];
}
ll ans = 0 ;
rep ( i , n ) {
REP ( j , i + 1 , n ) {
ans += min ( cost [ i ][ j ], cost [ j ][ i ]);
}
}
cout << ans << endl ;
return 0 ;
}