ZOJ2477 Magic Cube
题目：
This is a very popular game for children. In this game, there's a cube, which consists of 3 * 3 * 3 small cubes. We can unwrap the cube, it will become like this:
w w w
w w w
w w w
r r r g g g b b b o o o
r r r g g g b b b o o o
r r r g g g b b b o o o
y y y
y y y
y y y
The letters means the color on the small cubes. For example, 'r' means red, 'g' means green, 'y' means yellow....The goal for this game is to rotate the faces of the cube to make each of the faces contains only one color. Note there're exact 6 kind of colors on the cube and there're exact 9 small rectangles totally in any time in the game.
Do you know how to rotate the faces? I think most of you have known it. But I would like to show it again. When a face is rotated, the configuration of colors in all the adjacent faces changes. For the cube above, after we rotate the green face clock-wise, the last line of 'w' face will become the left column of 'b' face, the left column of 'b' face will become the top line of 'y' face, etc. As you may know, reaching the final position from a scrambled configuration can be quite challenging.
In this problem, you are given a configuration of the cube, and asked to give a way to reach the final position. To reduce the difficulty, the steps required will never be greater than 5.
输入：
The input contains an integer in the first line, which indicates the number of the test cases. In each test case, there're exact 10 lines. The first line is an empty line. The next 9 lines contain a configuration. The format can be seen in the sample input. For simplicity, we give an index to each face as follows:
/---\
| |
| 4 |
| |
/---+---+---+---\
| | | | |
| 0 | 1 | 2 | 3 |
| | | | |
\---+---+---+---/
| |
| 5 |
| |
\---/
Note that there's a space between two adjacent letters.
输出：
For each test case, the first line of the output is the smallest count N of the steps to reach the winning position. If the winning position can't be reached in 5 steps, print -1 in this line. Otherwise print each step in one line in the following N lines. A step contains two integers, the first one means the face index, and the second one means the direction. 1 means clock-wise and -1 means counter clock-wise. If the given position is the winning position, print 0 for such test case simply. If there're multiple solutions, any one is acceptable.
样例：
分析：我。。。自闭了两天竟然是没有写>5输出-1(°ཀ°)，为什么我会默认测试点必然可以在5步内实现啊(#`Д´)ﾉ
只能说这个模拟太恶心了！！！
用IDA*优化，思路是计算每一个面有几个和中心方格颜色不一样的方格，6个面的总数除12并向上取整是最少剩余需要的步数（如果最理想的情况加上已走步数仍然大于5那肯定没戏啊）
模拟写得相当丑(灬ºωº灬)
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<cstring>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<numeric>
#include<cmath>
#include<queue>
#include<vector>
#include<set>
#include<cctype>
#define PI acos(-1.0)
const int INF = 0x3f3f3f3f;
const int NINF = -INF - ;
typedef long long ll;
using namespace std;
char cube[][];
struct node
{
char maze[][];
};
struct cur
{
char maze[][];
};
node clockwise(node temp)
{
char gtm[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
memcpy(temp.maze, gtm, sizeof(temp.maze));
return temp;
}
node cclockwise(node temp)
{
char gtm[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
gtm[][] = temp.maze[][];
memcpy(temp.maze, gtm, sizeof(temp.maze));
return temp;
}
int bol, ans;
pair<int, int> P[];
void print()
{
for (int i = ; i < ans; ++i)
cout << P[i].first << ' ' << P[i].second << endl;
}
int hx(cur trans)
{
double sum = ;
for (int i = ; i < ; ++i)
{
for (int j = ; j < ; j += )
if (trans.maze[i][j] != trans.maze[][]) sum++;
}
for (int i = ; i < ; ++i)
{
for (int j = ; j < ; j += )
if (trans.maze[i][j] != trans.maze[][]) sum++;
}
for (int i = ; i < ; ++i)
{
for (int j = ; j < ; j += )
if (trans.maze[i][j] != trans.maze[][]) sum++;
}
for (int i = ; i < ; ++i)
{
for (int j = ; j < ; j += )
if (trans.maze[i][j] != trans.maze[][]) sum++;
}
for (int i = ; i < ; ++i)
{
for (int j = ; j < ; j += )
if (trans.maze[i][j] != trans.maze[][]) sum++;
}
for (int i = ; i < ; ++i)
{
for (int j = ; j < ; j += )
if (trans.maze[i][j] != trans.maze[][]) sum++;
}
return ceil(sum / );
}
void dfs(int rec, char pos[][], int deep)
{
if (rec > deep) return;
cur trans;
memcpy(trans.maze, pos, sizeof(trans.maze));
int h = hx(trans);
//cout << "test:" << h << endl;
if (h == )
{
ans = rec;
cout << rec << endl;
bol = ;
return;
}
if (h + rec > deep) return;
for (int i = ; i < ; ++i)
{
char tmp[][];
memcpy(tmp, pos, sizeof(tmp));
/*for (int j = 0; j < 9; ++j)
cout << tmp[j] << endl;
return;*/
node temp;
if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = clockwise(temp);
/*for (int m = 0; m < 3; ++m)
{
for (int n = 0; n < 3; ++n)
cout << temp.maze[m][n] << ' ';
cout << endl;
}*/
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = cclockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = clockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = cclockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = clockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = cclockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = clockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = cclockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = clockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = cclockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = clockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
else if (i == )
{
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
temp.maze[m][n] = tmp[k][j];
}
temp = cclockwise(temp);
for (int k = , m = ; k < , m < ; ++k, ++m)
{
for (int j = , n = ; j < , n < ; j += , ++n)
tmp[k][j] = temp.maze[m][n];
}
char cpy[][];
memcpy(cpy, tmp, sizeof(cpy));
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
cpy[][] = tmp[][];
memcpy(tmp, cpy, sizeof(tmp));
/*for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
return;*/
}
/*if (i == 1 && deep == 2)
{
cout << "first" << endl;
for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
}
if (i == 2 && deep == 2)
{
cout << "second" << endl;
for (int k = 0; k < 9; ++k)
cout << tmp[k] << endl;
}*/
dfs(rec + , tmp, deep);
//if (i == 1) return;
if (bol)
{
P[rec].first = i / ;
if (i % == ) P[rec].second = ;
else P[rec].second = -;
return;
}
}
}
int main()
{
int T;
cin >> T;
while (T--)
{
string nul;
getline(cin, nul);
for (int i = ; i < ; ++i)
{
char ss;
int num = ;
while ((ss = getchar()) != '\n')
{
if (ss != ' ') cube[i][num++] = ss;
else cube[i][num++] = ' ';
}
cube[i][num] = '\0';
}
/*for (int i = 0; i < 9; ++i)
cout << cube[i] << endl;*/
/*for (int i = 0; i < 3; ++i)
{
for (int j = 6; j < 11; j += 2)
{
cout << cube[i][j] << ' ';
}
cout << endl;
}*/
/*cur gat;
memcpy(gat.maze, cube, sizeof(gat.maze));
int p = judge(gat);
cout << p << endl;*/
bol = , ans = ;
for (int i = ; i <= ; ++i)
{
//cout << "deep:" << i << endl;
dfs(, cube, i);
if (bol)
{
print();
break;
}
}
if (!bol) cout << - << endl;
}
return ;
}
ZOJ2477 Magic Cube的更多相关文章
- ZOJ 2477 Magic Cube（魔方）
ZOJ 2477 Magic Cube(魔方) Time Limit: 2 Seconds Memory Limit: 65536 KB This is a very popular gam ...
- ZOJ 2477 Magic Cube 暴力,模拟 难度:0
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1477 用IDA*可能更好,但是既然时间宽裕数据简单,而且记录状态很麻烦,就直接 ...
- magic cube
搜索题, 每个状态能扩展出12种状态,最多进行5次旋转12^5 要用到iddfs,或者我看到网上其他人用的ida* 我也是参考了别人的代码,而且这个题vj上有点问题,我看数据看了半天,愣是没看明白第二 ...
- 2019杭电多校二 F. Fantastic Magic Cube (FWT)
大意: 给定$N^3$立方体, 每个单位立方体权值为三个坐标异或, 每次沿坐标轴切一刀, 得分为两半内权值和的乘积, 求切成$n^3$块的最大得分. 可以发现得分与切法无关, 假设每个点权值为$a_i ...
- sdutoj 2606 Rubik’s cube
http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2606 Rubik’s cube Time Li ...
- USACO 3.2 Magic Squares
Magic SquaresIOI'96 Following the success of the magic cube, Mr. Rubik invented its planar version, ...
- 用DirectX实现魔方（一）
关于魔方 魔方英文名字叫做Rubik's Cube,是由匈牙利建筑学教授和雕塑家Ernő Rubik于1974年发明,最初叫做Magic Cube(这大概也是中文名字的来历吧),1980年Ideal ...
- 一位学长的ACM总结（感触颇深）
发信人: fennec (fennec), 信区: Algorithm 标 题: acm 总结 by fennec 发信站: 吉林大学牡丹园站 (Wed Dec 8 16:27:55 2004) AC ...
- ZOJ - 2477 dfs [kuangbin带你飞]专题二
注意输入的处理,旋转操作打表.递增枚举可能步数,作为限制方便找到最短路. AC代码:90ms #include<cstdio> #include<cstring> char m ...
随机推荐
- 删数据ORA-02292主键约束问题
通常在删除某个表A的时候,会出现这个错误.原因是另一个表B的某个字段引用了A表的某个字段作为约束(这个的另一个说法是外键). 假如引用的字段叫field,当B.field = A.field , 而你 ...
- thinkphp里模版文件js无法使用if condition的问题
/** * @example thinkphp里模版文件js无法使用if condition的问题 * @example 参考地址:https://segmentfault.co ...
- vue和iview中native点击事件修饰
在父组件中给子组件绑定一个原生的事件,就将子组件变成了普通的HTML标签,不加'. native'事件是无法触 在vue中使用iview的dropdownMenu 上单纯的@click也不生效,要写成 ...
- C# DataTable扩展方法
在日常搬砖中,总结了一些简单的扩展方法. public static bool IsNullOrEmpty(this DataTable dt) { ; } public static bool Is ...
- 有赞 MySQL 自动化运维之路 — ZanDB
转自:https://tech.youzan.com/youzan-mysql-auto-ops-road/ 一.前言 在互联网时代,业务规模常常出现爆发式的增长.快速的实例交付,数据库优化以及备份管 ...
- ES6学习历程(字符串的扩展)
字符串的扩展 在看这一节的时候前半部分写的都是关于unicode的内容,我个人感觉这部分在实际的开发中用的很少,所以不打算在做记录,等届时用到再有针对性的看,所以就将在ES6里面关于字符串操作的一些新 ...
- Win32 线程同步
Win32 线程同步 ## Win32线程同步 ### 1. 原子锁 ### 2. 临界区 {全局变量} CRITICAL_SECTION CS = {0}; // 定义并初始化临界区结构体变量 {线 ...
- python爬虫13 | 秒爬，这多线程爬取速度也太猛了，这次就是要让你的爬虫效率杠杠的
快 快了 啊 嘿 小老弟 想啥呢 今天这篇爬虫教程的主题就是一个字 快 想要做到秒爬 就需要知道 什么是多进程 什么是多线程 什么是协程(微线程) 你先去沏杯茶 坐下来 小帅b这就好好给你说道说道 关 ...
- JSTL 实现 为Select赋多个值
需要注意需要在.jsp文件中引入相应的类库 <%@ taglib prefix="c" uri="http://java.sun.com/jsp/jstl/core ...
- 基于Python3.7和opencv的人脸识别（含数据收集，模型训练）
前言 第一次写博客,有点紧张和兴奋.废话不多说,直接进入正题.如果你渴望使你的电脑能够进行人脸识别:如果你不想了解什么c++.底层算法:如果你也不想买什么树莓派,安装什么几个G的opencv:如果你和 ...