15:I[42907,["401","static/chunks/363642f4-812e50cc3e323d2c.js","213","static/chunks/213-b2337299901a9046.js","152","static/chunks/152-6ad5ee8e457afbb4.js","393","static/chunks/393-460011df65777e34.js","659","static/chunks/app/codes/%5Bid%5D/page-f39212c89e2a3314.js"],"CodeViewer"] 16:T6a9,#include #include #include #include #include #include #include #include using namespace std; struct Pos { int y, x; Pos operator-(const Pos pos) const { return { y - pos.y, x - pos.x }; } int DistanceTo(const Pos& pos) const { Pos tmp = pos - *this; return abs(tmp.y) + abs(tmp.x); } }; int GetAllDistance(const vector& houses, const vector& stores) { int allDistance = 0; for (Pos house : houses) { int distance = 10000000; for (Pos store : stores) distance = min(distance, house.DistanceTo(store)); allDistance += distance; } return allDistance; } void Rec(vector stores, int before, int index, vector tmpStores, vector houses, int& minV) { if (before == -1) { minV = min(minV, GetAllDistance(houses, tmpStores)); return; } for (int i = index + 1; i < stores.size() - before; i++) { tmpStores.push_back(stores[i]); Rec(stores, before - 1, i, tmpStores, houses, minV); tmpStores.pop_back(); } } int main() { int n, m; cin >> n >> m; vector houses; vector stores; for (int y = 0; y < n; y++) { for (int x = 0; x < n; x++) { int num; cin >> num; if (num == 1) houses.push_back({ y, x }); if (num == 2) stores.push_back({ y, x }); } } int minV = 10000000; vector tmpStores; Rec(stores, m - 1, -1, tmpStores, houses, minV); cout << minV; return 0; } 5:["$","div",null,{"className":"container mx-auto px-

코드 #526