-
Notifications
You must be signed in to change notification settings - Fork 0
/
백준 - 치킨 배달.cpp
102 lines (78 loc) · 1.96 KB
/
백준 - 치킨 배달.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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
// 문제 링크 : https://www.acmicpc.net/problem/15686
#include <iostream>
#include <vector>
#include <math.h>
#define MAX 50
#define MAX_CHICKEN 13
using namespace std;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
bool visited[MAX_CHICKEN];
int ans = (int)1e9;
int get_distance(pii p1, pii p2){
return abs(p1.first-p2.first)+abs(p1.second-p2.second);
}
int total_distance(vpii& house, vpii chicken){
int res = 0;
int house_size = house.size();
int chicken_size = chicken.size();
for(int i=0;i<house_size;++i){
int minn = (int)1e9;
for(int j=0;j<chicken_size;++j){
minn = min(minn, get_distance(house[i], chicken[j]));
}
res+=minn;
}
return res;
}
vpii get_included(vpii& chicken){
vpii res;
int size = chicken.size();
for(int i=0;i<size;++i){
if(visited[i]){
res.push_back(chicken[i]);
}
}
return res;
}
void go(int target, int index, int cnt, vpii& house, vpii& chicken) {
if(target == cnt){
ans = min(total_distance(house, get_included(chicken)), ans);
return;
}
int size = chicken.size();
for(int i=index+1;i<size;++i){
if(!visited[i]){
visited[i] = true;
go(target, i, cnt+1, house, chicken);
visited[i] = false;
}
}
return;
}
int main(void){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
int info;
vpii house;
vpii chicken;
cin>>n>>m;
for(int i=0;i<n;++i){
for(int j=0;j<n;++j){
cin>>info;
if(info == 1) {
house.push_back(pii(i, j));
}
else if(info == 2){
chicken.push_back(pii(i, j));
}
}
}
for(int i=1;i<=m;++i){
go(i, -1, 0, house, chicken);
}
cout<<ans<<'\n';
return 0;
}