알고리즘/BOJ1 BOJ / 감시 https://www.acmicpc.net/problem/15683 #include #include #include using namespace std; int N, M; int ans; const int DIR[] = { -1, 0, 1, 0,-1 }; vector cctv; void count(vector &grid) { int c = 0; for (int i = 0; i c) print(grid); ans = min(ans, c); } bool isValid(int y, int x) { return 0 = 3) fillLine(grid, cur, (dir +.. 2022. 12. 19. 이전 1 다음