모의A
-
2117. [모의 SW 역량테스트] 홈 방범 서비스SWexpertAcademy 2019. 7. 28. 05:21
#include #include #include #include #include #include using namespace std; int tc; int n, m; int map[20][20]; int v[22][22]; int dd[22]; int cost[22]; int ans = 0; int dx[] = { 0,0,1,-1 }; int dy[] = { 1,-1,0,0 }; void initial(); void making_secu(int x, int y) { queue q; q.push(make_pair(x, y)); int cnt = map[x][y]; v[x][y] = 1; while (!q.empty()) { x = q.front().first; y = q.front().second; q.p..