15:I[42907,["401","static/chunks/363642f4-812e50cc3e323d2c.js","213","static/chunks/213-b2337299901a9046.js","152","static/chunks/152-6ad5ee8e457afbb4.js","393","static/chunks/393-460011df65777e34.js","659","static/chunks/app/codes/%5Bid%5D/page-f39212c89e2a3314.js"],"CodeViewer"] 16:T780,#include #include #include #include #include #include #define ll long long #define sz(x) ((int)(x).size()) #define rep(i, n) for(int i=0; i<(n); i++) #define set0(arr) memset(arr, 0, sizeof(arr)) using namespace std; int dr[] = {0,0,-1,1}; int dc[] = {1,-1,0,0}; int n, m; inline bool isvalid(int r, int c) { return r>=0 && r=0 && c> n >> m >> r >> c >> K; int arr[n][m]; rep(i,n) rep(j,m) cin >> arr[i][j]; vector dice(6); // T U L R F B rep(k, K) { int dir, tr, tc; cin >> dir; dir--; tr = r+dr[dir], tc = c+dc[dir]; if(!isvalid(tr, tc)) continue; if(dir == 0) { // 동 // T->R->U->L->T int temp = dice[c2i('t')]; dice[c2i('t')] = dice[c2i('l')]; dice[c2i('l')] = dice[c2i('u')]; dice[c2i('u')] = dice[c2i('r')]; dice[c2i('r')] = temp; } else if(dir == 1) { // 서 // T->L->U->R->T int temp = dice[c2i('t')]; dice[c2i('t')] = dice[c2i('r')]; dice[c2i('r')] = dice[c2i('u')]; dice[c2i('u')] = dice[c2i('l')]; dice[c2i('l')] = temp; } else if(dir == 2) { // 남 // T->F->U->B->T int temp = dice[c2i('t')]; dice[c2i('t')] = dice[c2i('b')]; dice[c2i('b')] = dice[c2i('u')]; dice[c2i('u')] = dice[c2i('f')]; dice[c2i('f')] = temp; } else { // 복 int temp = dice[c2i('t')]; dice[c2i('t')] = dice[c2i('f')]; dice[c2i('f')] = dice[c2i('u')]; dice[c2i('u')] = dice[c2i('b')]; dice[c2i('b')] = temp; } cout << dice[c2i

코드 #80