백준 2630 c++

magicdrill·2024년 3월 12일

백준 문제풀이

목록 보기
136/673

백준 2630 c++

#include <iostream>

using namespace std;

bool** paper;
int white = 0, blue = 0;;

int input(int lower, int upper)
{
	//cout << "input()" << endl;
	int A;

	while (1)
	{
		cin >> A;
		if (A >= lower && A <= upper)
		{
			break;
		}
		else
		{
			;
		}
	}

	return A;
}

void input_paper(bool** paper, int N)
{
	int i, j;

	for (i = 0; i < N; i++)
	{
		for (j = 0; j < N; j++)
		{
			paper[i][j] = input(0, 1);
		}
	}

	/*for (i = 0; i < N; i++)
	{
		for (j = 0; j < N; j++)
		{
			cout << paper[i][j] << " ";
		}
		cout << "\n";
	}*/

	return;
}

void cut_paper(int A, int B, int C)
{
	bool cut = false;
	int i, j;
	bool temp = paper[A][B];

	for (i = A; i < A + C; i++)
	{
		for (j = B; j < B + C; j++)
		{
			if (paper[i][j] != temp)
			{
				cut = true;
				break;
			}
			else
			{
				;
			}
		}
	}
	if (cut == true)
	{
		cut_paper(A, B, C / 2);
		cut_paper(A + C / 2, B, C / 2);
		cut_paper(A, B + C / 2, C / 2);
		cut_paper(A + C/2, B+C/2, C / 2);
	}
	else
	{
		if (temp == 0)
		{
			white++;
		}
		else
		{
			blue++;
		}
	}

	return;
}

void find_result(bool** paper, int N)
{
	cut_paper(0, 0, N);

	cout << white << "\n" << blue;

	return;
}

int main(void)
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int N, i;
	

	N = input(2, 128);
	paper = new bool* [N];
	for (i = 0; i < N; i++)
	{
		paper[i] = new bool[N];
	}
	input_paper(paper, N);
	find_result(paper, N);
	for (i = 0; i < N; i++)
	{
		delete[] paper[i];
	}
	delete[] paper;

	return 0;
}

0개의 댓글