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 ...
随机推荐
- SqlServer Function
set quoted_identifier on; set ansi_nulls on; go create function [dbo].[Get_StrArrayStrOfIndex] ( @st ...
- 从零开始的 webpack4 + vue2.x
新建文件夹 webpack-vue 安装依赖 yarn init //初始化package.json yarn add webpack webpack-cli //添加webpack.webpack- ...
- vue数据绑定源码
思路分析 数据的双向绑定,就是数据变化了自动更新视图,视图变化了自动更新数据,实际上视图变化更新数据只要通过事件监听就可以实现了,并不是数据双向绑定的关键点.关键还是数据变化了驱动视图自动更新. 所有 ...
- 《零压力学Python》 之 第一章知识点归纳
第一章(初识Python)知识点归纳 Python是从ABC语言衍生而来的 ABC语言是Guido参与设计的一种教学语言,为非专业编程人员所开发的. Python是荷兰程序员 Guido Van Ro ...
- 洛谷 2042 BZOJ 1500 NOI 2005 维护数列
[题意概述] 维护一个数列,要求支持以下6种操作: [题解] 大Boss...可以用Treap解决 需要用到垃圾回收.线性建树. #include<cstdio> #include< ...
- TypeError: CleanWebpackPlugin is not a constructor
在项目中引入clean-webpack-plugin打包后报错 new CleanWebpackPlugin(), ^ TypeError: CleanWebpackPlugin is not a c ...
- Django——7 常用的查询 常用的模型字段类型 Field的常用参数 表关系的实现
Django 常用的查询 常用的查询方法 常用的查询条件 常用字段映射关系 Field常用参数 表关系的实现 查用的查询方法 这是需要用到的数据 from django.http import Htt ...
- 【Codeforces Global Round 1 A】Parity
[链接] 我是链接,点我呀:) [题意] 给你一个k位数b进制的进制转换. 让你求出来转成10进制之后这个数字是奇数还是偶数 [题解] 模拟一下转换的过程,加乘的时候都记得对2取余就好 [代码] im ...
- kendo Grid Unexpected number错误
这种用了自定义function来代替默认的就需要把所有的created,update等都替换掉,不能只替换部分
- Ubuntu 17.10安装phpMyAdmin数据库管理工具
和Windows下各种双击安装直接使用的数据库管理工具不同,Linux下的数据库管理工具显得有些稍稍复杂.由于版权和收费限制,很多好用的数据库管理工具例如Data Grip和Navicat不能直接 ...