BOJ - 큐빙(5373)

골드1 : 구현, 시뮬레이션 문제이다.

Code

#include<iostream>
#include<vector>
#include<string>
using namespace std;
 
int T, n;
 
void clockwise(vector<vector<char>>&a)
{
    char temp = a[0][0];
    a[0][0] = a[2][0];
    a[2][0] = a[2][2];
    a[2][2] = a[0][2];
    a[0][2] = temp;
 
    temp = a[0][1];
    a[0][1] = a[1][0];
    a[1][0] = a[2][1];
    a[2][1] = a[1][2];
    a[1][2] = temp;
    return;
}
 
void U(vector<vector<vector<char>>>&a)
{
    vector<vector<char>> temp = a[5];
    a[5] = a[0];
    a[0] = a[4];
    a[4] = a[1];
    a[1] = temp;
 
    clockwise(a[1]); clockwise(a[1]);
    clockwise(a[4]); clockwise(a[4]);
    clockwise(a[2]);
    clockwise(a[3]); clockwise(a[3]); clockwise(a[3]);
    return;
}
 
void F(vector<vector<vector<char>>>&a)
{
    vector<vector<char>> temp = a[2];
    a[2] = a[5];
    a[5] = a[3];
    a[3] = a[4];
    a[4] = temp;
 
    clockwise(a[2]);
    clockwise(a[4]);
    clockwise(a[3]);
    clockwise(a[5]);
    clockwise(a[1]); clockwise(a[1]); clockwise(a[1]);
    clockwise(a[0]);
    return;
}
 
void L(vector<vector<vector<char>>>&a)
{
    // 0 -> 2 -> 1 -> 3
    vector<vector<char>> temp = a[0];
    for (int i = 0; i < 3; i++)
    {
        a[0][i][0] = a[3][i][0];
        a[3][i][0] = a[1][i][0];
        a[1][i][0] = a[2][i][0];
        a[2][i][0] = temp[i][0];
    }
    clockwise(a[4]);
    return;
}
void R(vector<vector<vector<char>>>&a)
{
    // 0 -> 3 -> 1 -> 2
    vector<vector<char>> temp = a[0];
    for (int i = 0; i < 3; i++)
    {
        a[0][i][2] = a[2][i][2];
        a[2][i][2] = a[1][i][2];
        a[1][i][2] = a[3][i][2];
        a[3][i][2] = temp[i][2];
    }
    clockwise(a[5]);
    return;
}
int main(void)
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
 
    cin >> T;
    char command, clock;
 
    for (int tc = 0; tc < T; tc++) {
        vector<vector<vector<char>>> cube;
        cube.push_back(vector<vector<char>>(3, vector<char>(3, 'w')));
        cube.push_back(vector<vector<char>>(3, vector<char>(3, 'y')));
        cube.push_back(vector<vector<char>>(3, vector<char>(3, 'r')));
        cube.push_back(vector<vector<char>>(3, vector<char>(3, 'o')));
        cube.push_back(vector<vector<char>>(3, vector<char>(3, 'g')));
        cube.push_back(vector<vector<char>>(3, vector<char>(3, 'b')));
 
        cin >> n;
        for (int i = 0; i < n; i++)
        {
            cin >> command >> clock;
            int k = 1;
            if (clock == '-') k = 3;
 
            if (command == 'U')
            {
                U(cube);
                for (int j = 0; j < k; j++) R(cube);
                for (int j = 0; j < 3; j++) U(cube);
            }
            else if (command == 'D')
            {
                U(cube);
                for (int j = 0; j < k; j++) L(cube);
                for (int j = 0; j < 3; j++) U(cube);
            }
            else if (command == 'F')
            {
                F(cube);
                for (int j = 0; j < k; j++) L(cube);
                for (int j = 0; j < 3; j++) F(cube);
            }
            else if (command == 'B')
            {
                F(cube);
                for (int j = 0; j < k; j++) R(cube);
                for (int j = 0; j < 3; j++) F(cube);
            }
            else if (command == 'L')
            {
                for(int j = 0; j < k; j++) L(cube);
            }
            else if (command == 'R')
            {
                for (int j = 0; j < k; j++) R(cube);
            }
        }
        for (int i = 0; i < 3; i++)
        {
            for (int j = 0; j < 3; j++)
                cout << cube[0][i][j];
            cout << '\n';
        }
    }
    return 0;
}
 
 

Reference

• 백준(5373번) - 큐빙