[SWEA 4013] 특이한 자석

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do

#include <iostream>

#include <algorithm>

using namespace std;

 

int i, j, K, result;

int a[4][8]; int ro[40][2]; int check[4][2];

 

void rotation(int i, int wh)

{

    int tmp;

    if (wh == 1)

    {

        tmp = a[i][1]; a[i][1] = a[i][0];

        for (j = 2;j < 8;j++)

        {

            swap(a[i][j], tmp);

        }

        a[i][0] = tmp;

    }

    else if (wh == -1)

    {

        tmp = a[i][6]; a[i][6] = a[i][7];

        for (j = 5;j >= 0;j--)

        {

            swap(a[i][j], tmp);

        }

        a[i][7] = tmp;

    }

}

 

void move(int now)

{

    if (now + 1 < 4 && check[now + 1][0] != 1 && a[now][2] != a[now + 1][6])

    {

        check[now + 1][0] = 1; check[now + 1][1] = check[now][1] * -1; move(now + 1);

    }

    if (now - 1 >= 0 && check[now - 1][0] != 1 && a[now][6] != a[now - 1][2])

    {

        check[now - 1][0] = 1; check[now - 1][1] = check[now][1] * -1; move(now - 1);

    }

}

 

void cal()

{

    int count = 0;

    while (K--)

    {

        for (i = 0;i < 4;i++) for(j=0;j<2;j++) check[i][j] = 0;

         

        int now = ro[count][0] - 1;

        check[now][0] = 1; check[now][1] = ro[count][1];

 

        move(now);

 

        for (i = 0;i < 4;i++)

        {

            if (check[i][0] == 1) rotation(i, check[i][1]);

        }

 

        count++;

    }

 

    for (i = 0; i < 4; i++) if (a[i][0] == 1) result += (int)pow(2, (double)i);

}

 

int main()

{

    int T; int t = 1;

    cin >> T;

    while (T--)

    {

        cin >> K; result = 0;

        for (i = 0; i < 4; i++) for (j = 0;j < 8;j++) cin >> a[i][j];

        for (i = 0;i < K;i++) cin >> ro[i][0] >> ro[i][1];

 

        cal();

         

        cout << "#" << t << " " << result << endl;

 

        t++;

    }

 

    return 0;

}