POJ2741 Colored Cubes

Description

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 <= n <= 4. 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 cubes 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

 

 

正解：搜索

解题报告：

　　今天考试考了这道题，考场上调试了一会儿，毕竟是半码农题。。。

　　考虑对于每一个立方体，如果我确立了一个面为顶面，则还可选择相邻的四个面中的一个，则可唯一确定一个立方体，那么一共有6*4=24种状态。一共有4个立方体，那么显然我只需要保持第一个不动，剩下三个枚举哪种状态就可以了。然后我们再对于四个确立好状态的立方体每个面贪心地染色，可以得出答案。

　　对于题目给的颜色名称我直接用map映射到int上去了，然后可以直接编号。

 

 

 //It is made by jump~
 #include <iostream>
 #include <cstdlib>
 #include <cstring>
 #include <cstdio>
 #include <cmath>
 #include <algorithm>
 #include <ctime>
 #include <vector>
 #include <queue>
 #include <map>
 #include <set>
 #ifdef WIN32
 #define OT "%I64d"
 #else
 #define OT "%lld"
 #endif
 using namespace std;
 typedef long long LL;
 const int MAXN = ;
 int biao[][]={
     {,,,,,},{,,,,,},{,,,,,},{,,,,,},
     {,,,,,},{,,,,,},{,,,,,},{,,,,,},
     {,,,,,},{,,,,,},{,,,,,},{,,,,,},
     {,,,,,},{,,,,,},{,,,,,},{,,,,,},
     {,,,,,},{,,,,,},{,,,,,},{,,,,,},
     {,,,,,},{,,,,,},{,,,,,},{,,,,,},
 };
 int n;
 int paint[MAXN][];
 int ans,ecnt;
 int rotat[MAXN],color[MAXN][];
 string ch;
 int col_cnt[MAXN*];//每种颜色
 map<string,int>mp;

 inline int getint()
 {
        int w=,q=;
        char c=getchar();
        while((c<'' || c>'') && c!='-') c=getchar();
        if (c=='-')  q=, c=getchar();
        while (c>='' && c<='') w=w*+c-'', c=getchar();
        return q ? -w : w;
 }

 inline void dfs(int d){
     if(d==n){
     for(int i=;i<n;i++) for(int j=;j<;j++) color[i][ biao[ rotat[i] ][j] ]=paint[i][j];

     int tot=;
     for(int j=;j<;j++) {//枚举每个面
         memset(col_cnt,,sizeof(col_cnt));
         int now=;
         for(int i=;i<n;i++){//考虑每个立方体
         col_cnt[ color[i][j] ]++;
         now=max(now,col_cnt[color[i][j]]);
         }
         tot+=n-now;
     }
     ans=min(ans,tot);

     return ;
     }
     for(int i=;i<;i++) rotat[d]=i,dfs(d+);
 }

 inline void work(){
     while() {
     n=getint(); if(n==) break;
     for(int i=;i<n;i++)
         for(int j=;j<;j++) {
         cin>>ch;
         if(mp[ch]!=) paint[i][j]=mp[ch];
         else { mp[ch]=++ecnt; paint[i][j]=mp[ch]; }
         }
     ans=n*;rotat[]=;//第一个立方体固定不动
     dfs();    printf("%d\n",ans);
     }
 }

 int main()
 {
   work();
   return ;
 }