UVa OJ 1352

#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<algorithm>
#include<cstdlib>
using namespace std;
const int maxn=4;
int n,dice[maxn][6],ans;
vector<string> names;
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},
{3,4,5,0,1,2},
{3,5,1,4,0,2},
{3,1,0,5,4,2},
{3,0,4,1,5,2},
{1,3,5,0,2,4},
{0,3,1,4,2,5},
{4,3,0,5,2,1},
{5,3,4,1,2,0},
};
int ID(const char*name){
    string s(name);
    int n=names.size();
    for(int i=0;i<n;i++)
       if(names[i]==s) return i;
    names.push_back(s);
    return n;
}
int r[maxn],color[maxn][6];
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(){
   while(scanf("%d",&n)==1&&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;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值