[BOJ] 백준 14499 주사위 굴리기

[문제]

https://www.acmicpc.net/problem/14499

 

 

[소스 코드]

import java.io.*;
import java.util.*;

public class Main {
	static int n,m,x,y;
	static int[][] map;
	static int[] dice;
	static int[] dr = {0,0,-1,1};
	static int[] dc = {1,-1,0,0};
	static int[][] info = {
			{2,0,3,5},
			{3,0,2,5},
			{1,0,4,5},
			{5,4,0,1}
	};
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		n = Integer.parseInt(st.nextToken());
		m = Integer.parseInt(st.nextToken());
		x = Integer.parseInt(st.nextToken());
		y = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		dice = new int[6];
		map = new int[n][m];
		for(int i=0;i<n;i++) {
			st = new StringTokenizer(br.readLine());
			for(int j=0;j<m;j++) {
				map[i][j] = Integer.parseInt(st.nextToken());
			}
		}
		st = new StringTokenizer(br.readLine());
		for(int i=0;i<k;i++) {
			int dir = Integer.parseInt(st.nextToken()) - 1;
			if(!move(dir)) continue;
			System.out.println(dice[0]);
		}
	}
	private static boolean move(int dir) {
		int nr = x + dr[dir];
		int nc = y + dc[dir];
		if(nr<0 || nr>=n || nc<0 || nc>=m) return false;
		int[] temp = dice.clone();
		for(int i=0;i<4;i++) {
			dice[info[dir][i]] = temp[info[dir][(i+1)%4]];
		}
		if(map[nr][nc]==0) {
			map[nr][nc] = dice[5];
		}
		else {
			dice[5] = map[nr][nc];
			map[nr][nc] = 0;
		}
		x = nr; y = nc;
		return true;
	}
}