#include #include #include #include #include #include #include #include #include #include #include using namespace std; #define INF __INT_MAX__ #define endl '\n' #define PLL pair #define X first #define R first #define Y second #define C second #define MAX (20 + 1) #define MAX_LEVEL (int)floor(log2(MAX)) int dr[4] = {0, 0, -1, 1}; int dc[4] = {1, -1, 0, 0}; vector dice(6, 0); int n, m, cur_r, cur_c, k; int board[MAX][MAX]; vector move(int d) { vector new_dice; switch (d) { case 1: new_dice = {dice[5], dice[3], dice[2], dice[0], dice[4], dice[1]}; break; case 2: new_dice = {dice[3], dice[5], dice[2], dice[1], dice[4], dice[0]}; break; case 3: new_dice = {dice[4], dice[2], dice[0], dice[3], dice[1], dice[5]}; break; case 4: new_dice = {dice[2], dice[4], dice[1], dice[3], dice[0], dice[5]}; break; } return new_dice; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n >> m >> cur_r >> cur_c >> k; for (int r = 0; r < n; r++) for (int c = 0; c < m; c++) cin >> board[r][c]; while (k--) { int cmd; cin >> cmd; int next_r = cur_r + dr[cmd - 1]; int next_c = cur_c + dc[cmd - 1]; if (next_r < 0 || n <= next_r || next_c < 0 || m <= next_c) continue; dice = move(cmd); int b = board[next_r][next_c]; (b == 0) ? board[next_r][next_c] = dice[1] : dice[1] = b, board[next_r][next_c] = 0; cout << dice[0] << endl; cur_r = next_r, cur_c = next_c; } return 0; }

제출 #185022

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: