1352 - Colored Cubes
Time limit: 3.000 seconds
There are several colored cubes. All of them are of the same size but they may be colored differently. Each face of these cubes has a single color. Colors of distinct faces of a cube may or may not be the same.
Two cubes are said to be identically colored if some suitable rotations of one of the cubes give identical looks to both of the cubes. For example, two cubes shown in Figure 2 are identically colored. A set of cubes is said to be identically colored if every pair of them are identically colored.
A cube and its mirror image are not necessarily identically colored. For example, two cubes shown in Figure 3 are not identically colored.
You can make a given set of cubes identically colored by repainting some of the faces, whatever colors the faces may have. In Figure 4, repainting four faces makes the three cubes identically colored and repainting fewer faces will never do.
Your task is to write a program to calculate the minimum number of faces that needs to be repainted for a given set of cubes to become identically colored.
Input
The input is a sequence of datasets. A dataset consists of a header and a body appearing in this order. A header is a line containing one positive integer n and the body following it consists of n lines. You can assume that 1
n4 . Each line in a body contains six color names separated by a space. A color name consists of a word or words connected with a hyphen (-). A word consists of one or more lowercase letters. You can assume that a color name is at most 24-characters long including hyphens.
A dataset corresponds to a set of colored cubes. The integer n corresponds to the number of cubes. Each line of the body corresponds to a cube and describes the colors of its faces. Color names in a line is ordered in accordance with the numbering of faces shown in Figure 5. A line
color1 color2 color3 color4 color5 color6
corresponds to a cube colored as shown in Figure 6.
The end of the input is indicated by a line containing a single zero. It is not a dataset nor a part of a dataset.
Output
For each dataset, output a line containing the minimum number of faces that need to be repainted to make the set of cub es identically colored.
Sample Input
3 scarlet green blue yellow magenta cyan blue pink green magenta cyan lemon purple red blue yellow cyan green 2 red green blue yellow magenta cyan cyan green blue yellow magenta red 2 red green gray gray magenta cyan cyan green gray gray magenta red 2 red green blue yellow magenta cyan magenta red blue yellow cyan green 3 red green blue yellow magenta cyan cyan green blue yellow magenta red magenta red blue yellow cyan green 3 blue green green green green blue green blue blue green green green green green green green green sea-green 3 red yellow red yellow red yellow red red yellow yellow red yellow red red red red red red 4 violet violet salmon salmon salmon salmon violet salmon salmon salmon salmon violet violet violet salmon salmon violet violet violet violet violet violet salmon salmon 1 red green blue yellow magenta cyan 4 magenta pink red scarlet vermilion wine-red aquamarine blue cyan indigo sky-blue turquoise-blue blond cream chrome-yellow lemon olive yellow chrome-green emerald-green green olive vilidian sky-blue 0
Sample Output
4 2 0 0 2 3 4 4 0 16
注意n最多为4，所以我们可以枚举所有的旋转后的每个面的位置，然后一一比较，看怎么涂色最优。
怎么旋转呢？
可以先用一个程序生成所有的位置状态：（参考《训练指南》P18~19）
#include<cstdio>
#include<cstring>
int left[] = {4, 0, 2, 3, 5, 1};
int up[] = {2, 1, 5, 0, 4, 3};
void rot(int* T, int* p)
{
int q[6];
memcpy(q, p, sizeof(q));
for (int i = 0; i < 6; i++) p[i] = T[q[i]];
}
void enumerate_permutations()
{
int p0[6] = {0, 1, 2, 3, 4, 5};
printf("int dice24[24][6] = {\n");
for (int i = 0; i < 6; i++)
{
int p[6];
memcpy(p, p0, sizeof(p0));
if (i == 0)
rot(up, p);
if (i == 1)
{
rot(left, p);
rot(up, p);
}
if (i == 3)
{
rot(up, p);
rot(up, p);
}
if (i == 4)
{
rot(left, p);
rot(left, p);
rot(left, p);
rot(up, p);
}
if (i == 5)
{
rot(left, p);
rot(left, p);
rot(up, p);
}
for (int j = 0; j < 4; j++)
{
printf("{%d, %d, %d, %d, %d, %d},\n", p[0], p[1], p[2], p[3], p[4], p[5]);
rot(left, p);
}
}
printf("};\n");
}
int main()
{
enumerate_permutations();
return 0;
}
完整代码：
/*0.062s*/
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
const int dice24[24][6] =
{
{2, 1, 5, 0, 4, 3}, {2, 0, 1, 4, 5, 3}, {2, 4, 0, 5, 1, 3}, {2, 5, 4, 1, 0, 3}, {4, 2, 5, 0, 3, 1},
{5, 2, 1, 4, 3, 0}, {1, 2, 0, 5, 3, 4}, {0, 2, 4, 1, 3, 5}, {0, 1, 2, 3, 4, 5}, {4, 0, 2, 3, 5, 1},
{5, 4, 2, 3, 1, 0}, {1, 5, 2, 3, 0, 4}, {5, 1, 3, 2, 4, 0}, {1, 0, 3, 2, 5, 4}, {0, 4, 3, 2, 1, 5},
{4, 5, 3, 2, 0, 1}, {1, 3, 5, 0, 2, 4}, {0, 3, 1, 4, 2, 5}, {4, 3, 0, 5, 2, 1}, {5, 3, 4, 1, 2, 0},
{3, 4, 5, 0, 1, 2}, {3, 5, 1, 4, 0, 2}, {3, 1, 0, 5, 4, 2}, {3, 0, 4, 1, 5, 2},
};
const int maxn = 4;
int n, dice[maxn][6], ans;
int r[maxn], color[maxn][6]; // 每个立方体的旋转方式和旋转后各个面的颜色
vector<string> names;
inline int ID(const char* name)
{
string s(name); // 由于输入量较小，使用string没有问题
int n = names.size();
for (int i = 0; i < n; i++)
if (names[i] == s)
return i;
names.push_back(s);
return n;
}
inline void check()
{
for (int i = 0; i < n; i++)
for (int j = 0; j < 6; j++)
color[i][dice24[r[i]][j]] = dice[i][j]; // 旋转后各个面的颜色
int tot = 0; // 需要重新涂色的面数
for (int j = 0; j < 6; j++) // 考虑每个面：统一正面，右面，顶面，底面，左面和后面的颜色
{
int cnt[maxn * 6]; // 每种颜色出现的次数
memset(cnt, 0, sizeof(cnt));
int maxface = 0;
for (int i = 0; i < n; i++)
maxface = max(maxface, ++cnt[color[i][j]]);
tot += n - maxface;
}
ans = min(ans, tot);
}
void dfs(int d)
{
if (d == n)
check();
else
{
for (int i = 0; i < 24; i++)
{
r[d] = i; // 立方体的旋转方式，每个都试一遍
dfs(d + 1);
}
}
}
int main(void)
{
while (scanf("%d", &n), n)
{
names.clear();
for (int i = 0; i < n; i++)
for (int j = 0; j < 6; j++)
{
char name[30];
scanf("%s", name);
dice[i][j] = ID(name);
}
ans = n * 6; // 上界：所有面都重涂色
r[0] = 0; // 第一个立方体不旋转
dfs(1);
printf("%d\n", ans);
}
return 0;
}
723
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
