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 | #include <stdio.h> int arr[1000][1000] = { 0 }; int white = 0, pink = 0; void cut(int y, int x, int len) { int num = arr[y][x],flag=0; for (int i = y; i < y + len; i++) { for (int j = x; j < x + len; j++) { if (arr[i][j] != num) { flag = 1; break; } } if (flag == 1) break; } if (num == 1 && flag == 0) { pink++; return; } else if (num == 0 && flag == 0) { white++; return; } else { cut(y, x, len / 2); cut(y, x+ len / 2, len / 2); cut(y+ len / 2, x, len / 2); cut(y+len / 2, x+ len / 2, len / 2); } } int main() { int n; scanf("%d", &n); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { scanf("%d", &arr[i][j]); } } cut(1, 1, n); printf("%d\n%d", white, pink); } | cs |
'알고리즘 > Divide and Conquer-일반' 카테고리의 다른 글
QuadTree 더블릿 (0) | 2019.03.05 |
---|---|
catoring along 더블릿 (0) | 2019.02.13 |
1992 쿼드트리 (0) | 2019.02.11 |