글 읽기 - 메모리 초과 질문

kbpak98 1년 전 0

queue에 node 정보를 넣을때 메모리 초과가 발생하는거 같은데 어디가 문제일까요...
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;

public class Main {
	static int MAX = Integer.MAX_VALUE;
	Queue<Current> route = new LinkedList<>();
	int[][] map;

	public static void main(String[] args) throws IOException {
		Main a = new Main();
		a.a();
	}

	public void a() throws IOException {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		StringTokenizer st = new StringTokenizer(br.readLine());

		int a = Integer.parseInt(st.nextToken());// 가로
		int b = Integer.parseInt(st.nextToken());// 세로

		map = new int[a+1][b + 1];
		for (int i = 0; i < a + 1; i++) {
			for (int j = 0; j < b + 1; j++) {
				map[i][j] = MAX;
			}
		}
		for (int i = 1; i <= a; i++) {
			String s = br.readLine();
			for (int j = 1; j <= b; j++) {
				map[i][j] = Integer.parseInt(String.valueOf(s.charAt(j - 1)));
			}
		}

		int tmp_a = 1;
		int tmp_b = 1;
		int tmp_length = 0;
		Current node = new Current(1, 1, 0, true);
		route.add(node);
		try {
			while (!(tmp_a == a && tmp_b == b)) {
				node = route.poll();
				tmp_a = node.getX();
				tmp_b = node.getY();
				tmp_length = node.getLength();
				boolean count = node.getCount();
				up(tmp_a, tmp_b, tmp_length, count);
				down(tmp_a, tmp_b, tmp_length, count);
				right(tmp_a, tmp_b, tmp_length, count);
				left(tmp_a, tmp_b, tmp_length, count);
			}
			bw.write(String.valueOf(tmp_length + 1));
			bw.flush();
		} catch (NullPointerException e) {
			bw.write(String.valueOf(-1));
			bw.flush();
		}
	}

	public void up(int x, int y, int length, boolean count) {
		map[x][y] = 2;
		try {
			if ((count && map[x - 1][y] == 1) || (map[x - 1][y] == 0)) {
				if (map[x - 1][y] == 1) {
					count = false;
					route.add(new Current(x - 1, y, length + 1, count));
				} else if (map[x - 1][y] == 0) {
					route.add(new Current(x - 1, y, length + 1, count));
				}
			} else if (!count && (map[x - 1][y] == 0)) {
				route.add(new Current(x - 1, y, length + 1, count));
			}
		} catch (ArrayIndexOutOfBoundsException e) {

		}
	}

	public void down(int x, int y, int length, boolean count) {
		map[x][y] = 2;
		try {
			if ((count && map[x + 1][y] == 1) || (map[x + 1][y] == 0)) {
				if (map[x + 1][y] == 1) {
					count = false;
					route.add(new Current(x + 1, y, length + 1, count));
				} else if (map[x + 1][y] == 0) {
					route.add(new Current(x + 1, y, length + 1, count));
				}
			} else if (!count && (map[x + 1][y] == 0)) {
				route.add(new Current(x + 1, y, length + 1, count));
			}
		} catch (ArrayIndexOutOfBoundsException e) {

		}
	}

	public void left(int x, int y, int length, boolean count) {
		map[x][y] = 2;
		try {
			if (count && map[x][y - 1] == 1 || (map[x][y - 1] == 0)) {
				if (map[x][y - 1] == 1) {
					count = false;
					route.add(new Current(x, y - 1, length + 1, count));
				} else if (map[x][y - 1] == 0) {
					route.add(new Current(x, y - 1, length + 1, count));
				}
			} else if (!count && (map[x][y - 1] == 0)) {
				route.add(new Current(x, y - 1, length + 1, count));
			}
		} catch (ArrayIndexOutOfBoundsException e) {

		}
	}

	public void right(int x, int y, int length, boolean count) {
		map[x][y] = 2;
		try {
			if (count && map[x][y + 1] == 1 || (map[x][y + 1] == 0)) {
				if (map[x][y + 1] == 1) {
					count = false;
					route.add(new Current(x, y + 1, length + 1, count));
				} else if (map[x][y + 1] == 0) {
					route.add(new Current(x, y + 1, length + 1, count));
				}
			} else if (!count && (map[x][y + 1] == 0)) {
				route.add(new Current(x, y + 1, length + 1, count));
			}
		} catch (ArrayIndexOutOfBoundsException e) {

		}
	}
}

class Current {
	int x;
	int y;
	int length;
	boolean count;// 벽 부수기 횟수

	public Current(int x, int y, int length, boolean count) {
		this.x = x;
		this.y = y;
		this.length = length;
		this.count = count;
	}

	public int getX() {
		return x;
	}

	public int getY() {
		return y;
	}

	public int getLength() {
		return length;
	}

	public boolean getCount() {
		return count;
	}
}
댓글을 작성하려면 로그인해야 합니다.
문제

문제

출처

ICPC

메모리 초과 질문

kbpak98 1년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말
