清北学堂模拟赛d5t6 cube

题面有误！10,11,12操作类别为A,13,14,15类别为B,16,17,18类别为C.
分析：一道大暴力，每次记录一下走了多少步，上一步操作类别是啥就可以了.最后只需要写6种操作，每一次操作进行4次就还原了，所以不用memcpy再来转.
#include <cstdio>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

int n, ans[], cnt, c[];

bool stop = false;

void turn1()

{

    int tmp, tmp2;

    tmp = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = tmp;

    tmp = c[];

    tmp2 = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = tmp2;

    c[] = tmp;

}

void turn2()

{

    int tmp,tmp2;

    tmp = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = tmp;

    tmp = c[];

    tmp2 = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = tmp2;

    c[] = tmp;

}

void turn3()

{

    int tmp = c[], tmp2;

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = tmp;

    tmp = c[];

    tmp2 = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = tmp;

    c[] = tmp2;

}

void turn4()

{

    int tmp = c[], tmp2;

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = tmp;

    tmp = c[];

    tmp2 = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = tmp;

    c[] = tmp2;

}

void turn5()

{

    int tmp = c[], tmp2;

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = tmp;

    tmp = c[];

    tmp2 = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = tmp2;

    c[] = tmp;

}

void turn6()

{

    int tmp = c[], tmp2;

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = tmp;

    tmp = c[];

    tmp2 = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = c[];

    c[] = tmp;

    c[] = tmp2;

}

bool check()

{

    return c[] == c[] && c[] == c[] && c[] == c[] &&

        c[] == c[] && c[] == c[] && c[] == c[] &&

        c[] == c[] && c[] == c[] && c[] == c[] &&

        c[] == c[] && c[] == c[] && c[] == c[] &&

        c[] == c[] && c[] == c[] && c[] == c[] &&

        c[] == c[] && c[] == c[] && c[] == c[];

}

void dfs(int dep, int flag)

{

    if (check())

    {

        cnt = dep;

        stop = ;

        return;

    }

    if (dep >= n)

        return;

    if (flag != )

    {

        for (int i = ; i <= ; i++)

        {

            turn1();

            ans[dep + ] = i;

            dfs(dep + , );

            if (stop)

                return;

        }

        turn1();

    }

    if (flag != )

    {

        for (int i = ; i <= ; i++)

        {

            turn2();

            ans[dep + ] =  + i;

            dfs(dep + , );

            if (stop)

                return;

        }

        turn2();

    }

    if (flag != )

    {

        for (int i = ; i <= ; i++)

        {

            turn3();

            ans[dep + ] =  + i;

            dfs(dep + , );

            if (stop)

                return;

        }

        turn3();

    }

    if (flag != )

    {

        for (int i = ; i <= ; i++)

        {

            turn4();

            ans[dep + ] =  + i;

            dfs(dep + , );

            if (stop)

                return;

        }

        turn4();

    }

    if (flag != )

    {

        for (int i = ; i <= ; i++)

        {

            turn5();

            ans[dep + ] =  + i;

            dfs(dep + , );

            if (stop)

                return;

        }

        turn5();

    }

    if (flag != )

    {

        for (int i = ; i <= ; i++)

        {

            turn6();

            ans[dep + ] =  + i;

            dfs(dep + , );

            if (stop)

                return;

        }

        turn6();

    }

}

int main()

{

    scanf("%d", &n);

    for (int i = ; i <= ; i++)

        scanf("%d", &c[i]);

    dfs(, );

    for (int i = ; i <= cnt; i++)

        printf("%d ", ans[i]);

    return ;

}
巴特西

清北学堂模拟赛d5t6 cube

最新文章

热门文章
