-
Notifications
You must be signed in to change notification settings - Fork 0
/
bj_14889_startandlink
55 lines (51 loc) · 1.2 KB
/
bj_14889_startandlink
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
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <list>
#include <cmath>
using namespace std;
int N;
int map[21][21];
int team[21];
long long int result = 100000000000;
long long int cal() {
long long int team1_val = 0;
long long int team2_val = 0;
vector <int> team1;
vector <int> team2;
for(int i=0; i<N; i++) {
if(team[i] == 1) team1.push_back(i);
else team2.push_back(i);
}
for(int i=0; i<team1.size()-1; i++) {
for(int j=i+1; j<team1.size(); j++) {
team1_val += (map[team1[i]][team1[j]] + map[team1[j]][team1[i]]);
team2_val += (map[team2[i]][team2[j]] + map[team2[j]][team2[i]]);
}
}
return abs(team2_val - team1_val);
}
void DFS(int index, int cnt) {
if(index >= N) return;
if(cnt >= N/2) {
result = min(result, cal());
return;
}
DFS(index + 1, cnt);
team[index] = 1;
DFS(index + 1, cnt + 1);
team[index] = 0;
//DFS(index + 1, cnt);
}
int main(void)
{
cin>>N;
for(int i=0; i<N; i++) {
for(int j=0; j<N; j++) cin>>map[i][j];
}
DFS(0,0);
cout<<result<<endl;
return 0;
}