15686번 치킨 배달

https://www.acmicpc.net/problem/15686

SW 역량 테스트를 대비할 겸 다시 풀어보았다.

38번 째 줄 실수를 했었다. 주석 참고할 것.

저번에 푼 코드 : https://hsdevelopment.tistory.com/103

#include <iostream>
#include <queue>
#include <stack>
#include <cstdio>
#include <vector>
#include <cstring>
#include <string>
#include <math.h>
#include <algorithm>
#include <map>
#include <set>
#include <sstream>
#include <tuple>
 
#pragma warning(disable:4996)  
#pragma comment(linker, "/STACK:336777216")
 
using namespace std;
 
int Map[52][52] = { 0, }, N = 0, M = 0, MIN = 0;
 
bool use[13] = { false, };
 
vector<pair<int, int> > chicken, home;
 
void simulation(vector<pair<int, int> > vc, int idx)
{
    if (vc.size() == M)
    {
        int sum = 0;
    
        for (int i = 0; i < home.size(); i++)
        {        
            int hy = home.at(i).first, hx = home.at(i).second, m = 50 * 50;
 
            for (int j = 0; j < vc.size(); j++)
            {
                int cy = vc.at(j).first, cx = vc.at(j).second; // 실수로 chicken vector를 사용했었다.
 
                int dist = abs(hy - cy) + abs(hx - cx);
 
                m = min(m, dist);
            }
 
            sum += m;
        }
 
        MIN = min(MIN, sum);
 
        return;
    }
 
    for (int i = idx; i < chicken.size(); i++)
        if (!use[i])
        {
            use[i] = true;
            vc.push_back({ chicken.at(i).first, chicken.at(i).second });
 
            simulation(vc, i + 1);
 
            use[i] = false;
            vc.pop_back();
        }
}
 
int main(void)
{
    MIN = 50 * 50;
 
    scanf("%d %d", &N, &M);
 
    for (int i = 0; i < N; i++)
        for (int j = 0; j < N; j++)
        {
            scanf("%d", &Map[i][j]);
 
            if (Map[i][j] == 1) home.push_back({ i, j });    
            else if (Map[i][j] == 2) chicken.push_back({ i, j });    
        }
 
    vector<pair<int, int> > vc;
 
    simulation(vc, 0);
 
    printf("%d\n", MIN);
 
    return 0;
}