algorithm'''problem solve
[백준]2630 - 색종이 만들기(설명X)
JunHwa Park
2020. 4. 8. 18:28
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 | #include <cstdio> bool isFilled(int** arr, int x, int y, int size, int color) { for (int i = 0; i < size; i++) { for (int j = 0; j < size; j++) if (arr[x + i][y + j] != color) return false; } return true; } void calc(int** arr, int x, int y, int size, int* white, int* filled) { if (isFilled(arr, x, y, size, 1)) { *white = *white - 1; *filled = *filled + 1; } else if (!isFilled(arr, x, y, size, 0) && size > 1) { *white = *white + 3; int half = size / 2; calc(arr, x, y, half, white, filled); calc(arr, x + half, y, half, white, filled); calc(arr, x, y + half, half, white, filled); calc(arr, x + half, y + half, half, white, filled); } } int main() { int N; scanf("%d", &N); int** paper = new int* [N]; for (int i = 0; i < N; i++) paper[i] = new int[N]; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { int tmp; scanf("%d", &tmp); paper[i][j] = tmp; } } int white = 1, filled = 0; int* w_ptr = &white; int* f_ptr = &filled; calc(paper, 0, 0, N, w_ptr, f_ptr); printf("%d %d\n", white, filled); } | cs |