#define _CRT_SECURE_NO_WARNINGS #include int map[10][10]; int n, m; int min_count=100; int k; // 카메라 개수 typedef struct Cam { int x; int y; int num; }Cam; Cam cam[10]; int top = -1; void init_arr(int depth) { for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (map[i][j] == depth+7) map[i][j] = 0; } void down(int x, int y, int depth) { while (1) { x++; if (map[x][y] == 6 || x==n+1) break; if (map[x][y] == 0) map[x][y] = 7 + depth; } } void up(int x, int y, int depth) { while (1) { x--; if (map[x][y] == 6 || x==0) break; if (map[x][y] == 0) map[x][y] = 7 + depth; } } void right(int x, int y, int depth) { while (1) { y++; if (map[x][y] == 6 || y==m+1) break; if(map[x][y]==0) map[x][y] = 7 + depth; } } void left(int x, int y, int depth) {//첫 카메라에 발각되면 7로 바꿈 while (1) { y--; if (map[x][y] == 6 || y==0) break; if (map[x][y] == 0) map[x][y] = 7 + depth; } } void num1(int x, int y, int d, int depth) { if (d == 0) down(x, y,depth); else if (d == 1) up(x, y,depth); else if (d == 2)right(x, y,depth); else left(x, y, depth); } void num2(int x, int y, int d, int depth) { if (d == 0) { down(x, y, depth); up(x, y, depth); } else { right(x, y, depth); left(x, y, depth); } } void num3(int x, int y, int d, int depth) { if (d == 0) { down(x, y, depth); right(x, y, depth); } else if (d == 1) { up(x, y, depth); right(x, y, depth); } else if (d == 2) { down(x, y, depth); left(x, y, depth); } else up(x, y, depth); left(x, y, depth); } void num4(int x, int y, int d, int depth) { if (d == 0) { down(x, y, depth); right(x, y, depth); up(x, y, depth); } else if (d == 1) { up(x, y, depth); right(x, y, depth); left(x, y, depth); } else if (d == 2) { down(x, y, depth); left(x, y, depth); up(x, y, depth); } else down(x, y, depth); left(x, y, depth); right(x, y, depth); } void num5(int x, int y, int depth) { up(x, y, depth); down(x, y, depth); right(x, y, depth); left(x, y, depth); } void func(int depth) { if (depth == k) { int cnt = 0; for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) if (map[i][j] == 0) cnt++; if (cnt < min_count) min_count = cnt; /* printf("mincount %d\n", min_count); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) printf("%d ", map[i][j]); printf("\n"); }*/ return; } for (int i = 0; i < 4; i++) { if ((cam[depth].num == 2 && i > 1) || (cam[depth].num == 5 && i > 0)) continue; if (cam[depth].num == 1) num1(cam[depth].x, cam[depth].y, i, depth); else if (cam[depth].num == 2) num2(cam[depth].x, cam[depth].y, i, depth); else if (cam[depth].num == 3) num3(cam[depth].x, cam[depth].y, i, depth); else if (cam[depth].num == 4) num4(cam[depth].x, cam[depth].y, i, depth); else num5(cam[depth].x, cam[depth].y, depth); func(depth + 1); init_arr(depth); } } int main() { scanf("%d %d", &n, &m); for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) { scanf("%d", &map[i][j]); if (map[i][j] >= 1 && map[i][j] <= 5) { top++; cam[top].x = i; cam[top].y = j; cam[top].num = map[i][j]; } } k = top + 1; func(0); printf("%d", min_count); return 0; }

제출 #14577

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: