-
Notifications
You must be signed in to change notification settings - Fork 6
/
1.cpp
48 lines (37 loc) · 1.13 KB
/
1.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 <cstdio>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
int N, M, houseSz, chickenSz, ans = 987654321;
vector<pair<int, int> > house, chicken;
int getDistance(int i, int j) {
return abs(house[i].first - chicken[j].first) + abs(house[i].second - chicken[j].second);
}
int main() {
scanf("%d %d", &N, &M);
int ipt;
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j) {
scanf("%d", &ipt);
if (ipt == 1) house.emplace_back(i, j);
else if (ipt == 2) chicken.emplace_back(i, j);
}
houseSz = house.size();
chickenSz = chicken.size();
vector<int> v(chickenSz, 0);
for (int i = 0; i < M; ++i) v[v.size() - 1 - i] = 1;
do {
int chickenRoad = 0;
for (int i = 0; i < houseSz; ++i) {
int cr = 987654321;
for (int j = 0; j < chickenSz; ++j)
if (v[j])
cr = min(cr, getDistance(i, j));
chickenRoad += cr;
}
ans = min(ans, chickenRoad);
} while (next_permutation(v.begin(), v.end()));
printf("%d\n", ans);
return 0;
}