[14499] 주사위 굴리기

#include <stdio.h>
#include <iostream>
 
#define MAX_SIZE 25
 
using namespace std;
 
int m, n;
int sx, sy;
int k;
int map[MAX_SIZE][MAX_SIZE];
int cmd[1000];
int dx[4] = { 0, 0, -1, 1 };//동서북남
int dy[4] = { 1, -1, 0, 0 };
int dice[6] = {0, };
 
void dice_move(int d){
    switch (d){
    case 0://동
        swap(dice[2], dice[0]);
        swap(dice[0], dice[3]);
        swap(dice[3], dice[5]);
        break;
    case 1://서
        swap(dice[3], dice[0]);
        swap(dice[0], dice[2]);
        swap(dice[2], dice[5]);
        break;
    case 2://북
        swap(dice[4], dice[5]);
        swap(dice[0], dice[4]);
        swap(dice[1], dice[0]);
        break;
    case 3://남
        swap(dice[1], dice[0]);
        swap(dice[0], dice[4]);
        swap(dice[4], dice[5]);
        break;
    }
 
}
 
void input(){
    scanf("%d %d", &m, &n);
    scanf("%d %d", &sx, &sy);
    scanf("%d", &k);
    for (int i = 0; i < m; i++){
        for (int j = 0; j < n; j++){
            scanf("%d", &map[i][j]);
        }
    }
 
    for (int i = 0; i < k; i++){
        int d;
        scanf("%d", &d);
        cmd[i] = d - 1;
    }
 
}
 
void solve(){
    int x = sx;
    int y = sy;
 
    for (int i = 0; i < k; i++){
        int nx = x + dx[cmd[i]];
        int ny = y + dy[cmd[i]];
 
        if (nx < 0 || ny < 0 || nx >= m || ny >= n) continue;
        
        dice_move(cmd[i]);//아래는 5번인덱스; 위는 0
 
        if (map[nx][ny] == 0){
            map[nx][ny] = dice[5];
        }
        else{
            dice[5] = map[nx][ny];
            map[nx][ny] = 0;
        }
        printf("%d\n", dice[0]);
 
        x = nx;
        y = ny;
    }
 
 
}
 
int main(){
    input();
    solve();
 
 
    return 0;
    
}