글 읽기 - c++ / 어디가 문제일까요..ㅠㅠ

pppp1923 4년 전 0

7 8 4

0 0 0 0 0 0 0 9

0 0 0 0 3 0 0 8

-1 0 5 0 0 0 22 0

-1 8 0 0 0 0 0 0

0 0 0 0 0 10 43 0

0 0 5 0 15 0 0 0

0 0 40 0 0 0 20 0

답 : 178

7 8 5

0 0 0 0 0 0 0 9

0 0 0 0 3 0 0 8

-1 0 5 0 0 0 22 0

-1 8 0 0 0 0 0 0

0 0 0 0 0 10 43 0

0 0 5 0 15 0 0 0

0 0 40 0 0 0 20 0

답 : 173

예제의

7 8 1 부터 7 8 3 까지는 맞는데 7 8 4 부터 179, 7 8 5는 174가 출력되네요..

어디가 잘못된 것일까요 ㅠㅠㅠ

#include <iostream>
#include <queue>
using namespace std;
int n, m, t;
int cleaner_up_row, cleaner_up_col, cleaner_down_row, cleaner_down_col;
int arr[1001][1001];
int save[1001][1001];
bool check[1001][1001];
queue<pair<int, int>> q;
int dr[] = { -1,0,1,0 };
int dc[] = { 0,1,0,-1 };

void start_upcleaner() {
	for (int i = cleaner_up_row - 1; i >= 1; i--) {
		arr[i][cleaner_up_col] = arr[i - 1][cleaner_up_col];
	}
	for (int i = 0; i < m - 1; i++) {
		arr[0][i] = arr[0][i + 1];
	}
	for (int i = 0; i <= cleaner_up_row; i++) {
		arr[i][m - 1] = arr[i + 1][m - 1];
	}
	for (int i = m - 1; i >= cleaner_up_col + 1; i--) {
		arr[cleaner_up_row][i] = arr[cleaner_up_row][i - 1];
	}
	arr[cleaner_up_row][cleaner_up_col + 1] = 0;
}

void start_downcleaner() {
	for (int i = cleaner_down_row + 1; i <= n - 2; i++) {
		arr[i][cleaner_down_col] = arr[i + 1][cleaner_down_col];
	}
	for (int i = 0; i <= m - 2; i++) {
		arr[n - 1][i] = arr[n - 1][i + 1];
	}
	for (int i = n - 1; i >= cleaner_up_row + 1; i--) {
		arr[i][m - 1] = arr[i - 1][m - 1];
	}
	for (int i = m - 1; i >= 2; i--) {
		arr[cleaner_down_row][i] = arr[cleaner_down_row][i - 1];
	}
	arr[cleaner_down_row][cleaner_down_col + 1] = 0;
}


void go() {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			save[i][j] = 0;
		}
	}
	int size = q.size();
	for (int i = 0; i < size; i++) {
		bool dir[4];
		for (int j = 0; j < 4; j++) {
			dir[j] = false;
		}
		int r = q.front().first;
		int c = q.front().second;
		q.pop();
		for (int k = 0; k < 4; k++) {
			int nr = r + dr[k];
			int nc = c + dc[k];
			if (0 <= nr && nr < n && 0 <= nc && nc < m) {
				if (arr[nr][nc] != -1) {
					dir[k] = true;
					if (check[nr][nc] == false) {
						q.push(make_pair(nr, nc));
					}
					check[nr][nc] = true;
				}
			}
		}
		int cnt = 0;
		for (int k = 0; k < 4; k++) {
			if (dir[k] == true) cnt++;
		}
		int x = arr[r][c] / 5;
		for (int k = 0; k < 4; k++) {
			if (dir[k] == true) {
				int nr = r + dr[k];
				int nc = c + dc[k];
				save[nr][nc] += x;
			}
		}
		arr[r][c] = arr[r][c] - x * cnt;
		if (arr[r][c] != 0) q.push(make_pair(r, c));
		else if (arr[r][c] == 0) {
			check[r][c] = false;
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			arr[i][j] += save[i][j];
		}
	}
}


int main() {
	cin >> n >> m >> t;
	bool isupcleaner = false;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> arr[i][j];
			if (arr[i][j] == -1 && isupcleaner == false) {
				isupcleaner = true;
				cleaner_up_row = i; cleaner_up_col = j;
				continue;
			}
			if (arr[i][j] == -1 && isupcleaner == true) {
				cleaner_down_row = i; cleaner_down_col = j;
				continue;
			}
			if (arr[i][j] != 0) {
				check[i][j] = true;
				q.push(make_pair(i, j));
			}
		}
	}

	for (int time = 1; time <= t; time++) {
		go();
		start_upcleaner();
		start_downcleaner();
	}

	int ans = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (arr[i][j] == -1) continue;
			ans += arr[i][j];
		}
	}
	cout << ans << "\n";

	return 0;
}

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

댓글을 작성하려면 로그인해야 합니다.

문제

문제

출처

ICPC

c++ / 어디가 문제일까요..ㅠㅠ

pppp1923 4년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말