-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path15686.cpp
48 lines (45 loc) · 1.01 KB
/
15686.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
#include<iostream>
#include<vector>
#include<cstdlib>
using namespace std;
int n, m;
vector<pair<int, int>>chicken;
vector<pair<int, int>>home;
int selectedChicken[14] = {0, };
void solving(int cnt, int start);
int answer = 987654321;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
int tmp;
for(int i = 0; i < n; i++){
for(int j = 0 ; j < n; j++){
cin >> tmp;
if(tmp == 1)
home.push_back({i, j});
else if(tmp == 2)
chicken.push_back({i, j});
}
}
solving(0, 0);
cout << answer;
}
void solving(int cnt, int start){
if(cnt == m){
int chickenDist = 0;
for(int i = 0; i < home.size(); i++){
int tmp = 987654321;
for(int j = 0; j < m; j++){
tmp = min(tmp, abs(home[i].first - chicken[selectedChicken[j]].first) + abs(home[i].second - chicken[selectedChicken[j]].second));
}
chickenDist += tmp;
}
answer = min(answer, chickenDist);
}
for(int i = start; i < (int)chicken.size(); i++){
selectedChicken[cnt] = i;
solving(cnt+1, i+1);
}
}