[백준] 17144번 미세먼지 안녕!

삼성 SW 역량 테스트 기출 문제인 17144번 문제

17144번: 미세먼지 안녕!

#include <iostream>
#include <tuple>
using namespace std;


int main() {
	int r, c, t;
	cin >> r >> c >> t;
	int** room = new int*[r];
	int** copyRoom = new int*[r];
	int** spreadRoom = new int*[r];
	for (int i = 0; i < r; i++) {
		room[i] = new int[c];
		copyRoom[i] = new int[c];
		spreadRoom[i] = new int[c];
	}
	pair<int, int> purifier[2];
	int index = 0;
	for (int i = 0; i < r; i++) {
		for (int j = 0; j < c; j++) {
			cin >> room[i][j];
			if (room[i][j] == -1) {
				purifier[index] = make_pair(i, j);
				index++;
			}
		}
	}
	for (int time = 0; time < t; time++) {
		if (time != 0) {
			for (int i = 0; i < r; i++) {
				for (int j = 0; j < c; j++) {
					room[i][j] = spreadRoom[i][j];
				}
			}
		}
		for (int i = 0; i < r; i++) {
			for (int j = 0; j < c; j++) {
				copyRoom[i][j] = room[i][j] / 5;
			}
		}
		for (int i = 0; i < r; i++) {
			for (int j = 0; j < c; j++) {
				spreadRoom[i][j] = 0;
			}
		}
		for (int i = 0; i < r; i++) {
			for (int j = 0; j < c; j++) {
				int count = 0;
				if (i - 1 >= 0 && !(i - 1 == purifier[0].first && j == purifier[0].second) && !(i - 1 == purifier[1].first && j == purifier[1].second)) {
					spreadRoom[i - 1][j] += copyRoom[i][j];
					count++;
				}
				if (i + 1 < r && !(i + 1 == purifier[0].first && j == purifier[0].second) && !(i + 1 == purifier[1].first && j == purifier[1].second)) {
					spreadRoom[i + 1][j] += copyRoom[i][j];
					count++;
				}
				if (j - 1 >= 0 && !(i == purifier[0].first && j - 1 == purifier[0].second) && !(i == purifier[1].first && j - 1 == purifier[1].second)) {
					spreadRoom[i][j - 1] += copyRoom[i][j];
					count++;
				}
				if (j + 1 < c && !(i == purifier[0].first && j + 1 == purifier[0].second) && !(i == purifier[1].first && j + 1 == purifier[1].second)) {
					spreadRoom[i][j + 1] += copyRoom[i][j];
					count++;
				}
				spreadRoom[i][j] += room[i][j] - count * copyRoom[i][j];
			}
		}


		int direction = 0; //위는 0, 오른쪽은 1, 아래는 2, 왼쪽은 3
		int row = purifier[0].first - 1;
		int col = purifier[0].second;
		while (true) {
			if (direction == 0) { //위쪽 방향일 때
				if (row - 1 >= 0) {
					spreadRoom[row][col] = spreadRoom[row - 1][col];
					row--;
				}
				else
					direction = 1;
			}
			if (direction == 1) { //오른쪽 방향일 때
				if (col + 1 < c) {
					spreadRoom[row][col] = spreadRoom[row][col + 1];
					col++;
				}
				else
					direction = 2;
			}
			if (direction == 2) { //아래 방향일 때
				if (row + 1 <= purifier[0].first) {
					spreadRoom[row][col] = spreadRoom[row + 1][col];
					row++;
				}
				else direction = 3;
			}
			if (direction == 3) {
				if (col - 1 >= 0) {
					if (spreadRoom[row][col - 1] == -1) {
						spreadRoom[row][col] = 0;
						col--;
						direction = 0;
						break;
					}
					else spreadRoom[row][col] = spreadRoom[row][col - 1];
					col--;
				}
			}
		}


		direction = 0;
		row = purifier[1].first + 1;
		col = purifier[1].second;
		while (true) {
			if (direction == 0) { //아래쪽 방향일 때
				if (row + 1 < r) {
					spreadRoom[row][col] = spreadRoom[row + 1][col];
					row++;
				}
				else
					direction = 1;
			}
			if (direction == 1) { //오른쪽 방향일 때
				if (col + 1 < c) {
					spreadRoom[row][col] = spreadRoom[row][col + 1];
					col++;
				}
				else
					direction = 2;
			}
			if (direction == 2) { //위쪽 방향일 때
				if (row - 1 >= purifier[1].first) {
					spreadRoom[row][col] = spreadRoom[row - 1][col];
					row--;
				}
				else direction = 3;
			}
			if (direction == 3) { //왼쪽 방향일 때
				if (col - 1 >= 0) {
					if (spreadRoom[row][col - 1] == -1) {
						spreadRoom[row][col] = 0;
						col--;
						direction = 0;
						break;
					}
					else spreadRoom[row][col] = spreadRoom[row][col - 1];
					col--;
				}
			}
		}
	}


	int sum = 0;
	for (int i = 0; i < r; i++) {
		for (int j = 0; j < c; j++) {
			sum += spreadRoom[i][j];
		}
	}
	cout << sum + 2 << endl;
	return 0;
}