글 읽기 - 도저히 모르겠습니다.

ninini6630 1년 전 0

입력 예제, 질문게시판 반례 다 해봤지만... 다 통과하는데 제출하자마자 계속 실패네요...

뭐가 문제일까요?

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

#define MAX(a,b) ((a) > (b) ? (a) : (b))

vector<vector<int>> house;
vector<vector<int>> temp;
vector<vector<int>> temp_diff;
vector<vector<int>> blowers;
vector<vector<int>> walls;
vector<vector<int>> pivots;
int R, C, K, W;
int choco = 0;

#define BLANK 0
#define RIGHT 1
#define LEFT 2
#define UP 3
#define DOWN 4
#define PIVOT 5
#define LEFT_UP 6
#define LEFT_DOWN 7
#define RIGHT_UP 8
#define RIGHT_DOWN 9

#define NO_WALL -1
#define UP_WALL 0
#define RIGHT_WALL 1

int dy[] = { 0,0,0,-1,1,0,-1,1,-1,1 };
int dx[] = { 0,1,-1,0,0,0,-1,-1,1,1 };

int can_blow(int y, int x, int dir, int ndir) {
	if (y < 1 || x < 1 || y > R || x > C) return 0;

	int wall_state = 0, obs[16] = { 0 };
	switch (ndir) {
	case RIGHT:
		if (walls[y + dy[LEFT]][x + dx[LEFT]] == RIGHT_WALL) return 0;
		break;
	case LEFT:
		if (walls[y][x] == RIGHT_WALL) return 0;
		break;
	case UP:
		if (walls[y + dy[DOWN]][x + dx[DOWN]] == UP_WALL) return 0;
		break;
	case DOWN:
		if (walls[y][x] == UP_WALL) return 0;
		break;
	case LEFT_UP:
		wall_state = 0;
		wall_state |= (walls[y][x] == RIGHT_WALL) << 0;
		wall_state |= (walls[y + dy[RIGHT] + dy[DOWN]][x + dx[RIGHT] + dy[DOWN]] == UP_WALL) << 1;
		wall_state |= (walls[y + dy[DOWN]][x + dx[DOWN]] == RIGHT_WALL) << 2;
		wall_state |= (walls[y + dy[DOWN]][x + dx[DOWN]] == UP_WALL) << 3;

		if (dir == LEFT && ((wall_state & 1 << 0) || (wall_state & 1 << 1))) return 0;
		if (dir == UP && ((wall_state & 1 << 2) || (wall_state & 1 << 3))) return 0;
		break;
	case LEFT_DOWN:
		wall_state = 0;
		wall_state |= (walls[y + dy[UP]][x + dx[UP]] == RIGHT_WALL) << 0;
		wall_state |= (walls[y + dy[RIGHT]][x + dx[RIGHT]] == UP_WALL) << 1;
		wall_state |= (walls[y][x] == RIGHT_WALL) << 2;
		wall_state |= (walls[y][x] == UP_WALL) << 3;

		if (dir == LEFT && ((wall_state & 1 << 1) || (wall_state & 1 << 2))) return 0;
		if (dir == DOWN && ((wall_state & 1 << 0) || (wall_state & 1 << 3))) return 0;
		break;
	case RIGHT_UP:
		wall_state = 0;
		wall_state |= (walls[y + dy[LEFT]][x + dx[LEFT]] == RIGHT_WALL) << 0;
		wall_state |= (walls[y + dy[DOWN]][x + dx[DOWN]] == UP_WALL) << 1;
		wall_state |= (walls[y + dy[LEFT] + dy[DOWN]][x + dx[LEFT] + dx[DOWN]] == RIGHT_WALL) << 2;
		wall_state |= (walls[y + dy[LEFT] + dy[DOWN]][x + dx[LEFT] + dx[DOWN]] == UP_WALL) << 3;

		if (dir == RIGHT && ((wall_state & 1 << 0) || (wall_state & 1 << 3))) return 0;
		if (dir == UP && ((wall_state & 1 << 1) || (wall_state & 1 << 2))) return 0;
		break;
	case RIGHT_DOWN:
		wall_state = 0;
		wall_state |= (walls[y + dy[UP] + dy[LEFT]][x + dx[UP] + dx[LEFT]] == RIGHT_WALL) << 0;
		wall_state |= (walls[y][x] == UP_WALL) << 1;
		wall_state |= (walls[y + dy[LEFT]][x + dx[LEFT]] == RIGHT_WALL) << 2;
		wall_state |= (walls[y + dy[LEFT]][x + dx[LEFT]] == UP_WALL) << 3;


		if (dir == RIGHT && ((wall_state & 1 << 2) || (wall_state & 1 << 3))) return 0;
		if (dir == DOWN && ((wall_state & 1 << 0) || (wall_state & 1 << 1))) return 0; 
		break;
	}

	return 1;
}

void sub_blow(int y, int x, int dir, int t) {
	if (!t) return;
	if (y < 1 || x < 1 || y > R || x > C) return;
	if (!temp_diff[y][x]) temp_diff[y][x] = t;

	int ny, nx, ndirs[3] = { dir };
	switch (dir) {
	case RIGHT:
		ndirs[1] = RIGHT_UP;
		ndirs[2] = RIGHT_DOWN;
		break;
	case LEFT:
		ndirs[1] = LEFT_UP;
		ndirs[2] = LEFT_DOWN;
		break;
	case UP:
		ndirs[1] = LEFT_UP;
		ndirs[2] = RIGHT_UP;
		break;
	case DOWN:
		ndirs[1] = LEFT_DOWN;
		ndirs[2] = RIGHT_DOWN;
		break;
	default:
		break;
	}

	for (int ndir : ndirs) {
		ny = y + dy[ndir];
		nx = x + dx[ndir];
		if (can_blow(ny, nx, dir, ndir)) sub_blow(ny, nx, dir, t - 1);
	}
}

void blow() {
	for (auto blower : blowers) {
		int y = blower[0];
		int x = blower[1];
		int dir = house[y][x];

		int ny = y + dy[dir];
		int nx = x + dx[dir];

		if (can_blow(y, x, dir, dir)) sub_blow(ny, nx, dir, 5);

		for (int y = 1; y <= R; y++) {
			for (int x = 1; x <= C; x++) {
				temp[y][x] += temp_diff[y][x];
				temp_diff[y][x] = 0;
			}
		}
	}
}

void adjust() {
	for (int y = 1; y <= R; y++) {
		for (int x = 1; x <= C; x++) {
			const int dy[] = { 1,0 };
			const int dx[] = { 0,1 };
			for (int i = 0; i < 2; i++) {
				int ny = y + dy[i];
				int nx = x + dx[i];
				if (ny < 1 || nx < 1 || ny > R || nx > C) continue;
				if (i == 0 && walls[ny][nx] == UP_WALL) continue;
				if (i == 1 && walls[y][x] == RIGHT_WALL) continue;
				int diff = floor(abs(temp[ny][nx] - temp[y][x]) / 4);
				int dir = temp[ny][nx] - temp[y][x] > 0;
				temp_diff[ny][nx] += dir ? -diff : diff;
				temp_diff[y][x] += dir ? diff : -diff;
			}
		}
	}

	for (int y = 1; y <= R; y++) {
		for (int x = 1; x <= C; x++) {
			temp[y][x] += temp_diff[y][x];
			temp_diff[y][x] = 0;
		}
	}
}

void reduce() {
	for (int y = 1; y <= R; y++) {
		temp[y][1] = MAX(temp[y][1] - 1, 0);
		if (y == 1 || y == R) {
			for (int x = 2; x < C; x++) {
				temp[y][x] = MAX(temp[y][x] - 1, 0);
			}
		}
		temp[y][C] = MAX(temp[y][C] - 1, 0);
	}
}

void eat() {
	choco++;
}

int invest() {
	if (pivots.empty()) return false;
	for (auto pivot : pivots) {
		int y = pivot[0];
		int x = pivot[1];
		if (temp[y][x] < K) return false;
	}
	return true;
}

int main() {
	cin.tie(NULL);
	ios::sync_with_stdio(false);

	cin >> R >> C >> K;

	house = vector<vector<int>>(R + 2, vector<int>(C + 2, 0));
	temp = vector<vector<int>>(R + 2, vector<int>(C + 2, 0));
	temp_diff = vector<vector<int>>(R + 2, vector<int>(C + 2, 0));
	walls = vector<vector<int>>(R + 2, vector<int>(C + 2, NO_WALL));

	for (int y = 1; y <= R; y++) {
		for (int x = 1; x <= C; x++) {
			cin >> house[y][x];
			if (house[y][x] != BLANK && house[y][x] != PIVOT) blowers.push_back({ y, x });
			if (house[y][x] == PIVOT) pivots.push_back({ y, x });
		}
	}
	
	cin >> W;

	for (int w = 0, y, x, t; w < W; w++) {
		cin >> y >> x >> t;
		walls[y][x] = t;
	}

	while (choco <= 100) {
		blow();
		adjust();
		reduce();
		eat();
		if (invest()) break;
	}
	
	cout << choco << "\n";


	return 0;
}

dirtkguddn 1년 전 4

walls 의 정보를 받을 때 walls[y][x] = t로 받게 되면 3 2 0 / 3 2 1 이런식으로 같은 좌표에서 벽의 정보를 받을 때 wall[3][2] = 1로 최종적으로 저장되어서 위아래 모두 벽이 있을 경우 오류가 발생하게 됩니다.

7 8 100
0 0 0 0 0 0 0 0
0 0 2 0 4 0 0 0
0 0 0 0 0 0 0 0
0 0 5 5 0 0 0 0
0 0 0 0 0 5 1 0
0 1 0 0 0 0 0 0
0 0 0 0 3 0 0 0
9
3 1 0
1 2 0
3 2 1
6 1 1
2 5 1
4 5 1
4 3 1
5 5 0
3 2 0

답 : 48

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

문제

문제

출처

ICPC

도저히 모르겠습니다.

ninini6630 1년 전 0

dirtkguddn 1년 전 4

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말