hihoCoder 1426 : What a Ridiculous Election（总统夶选）

hihoCoder #1426 : What a Ridiculous Election（总统夶选）

时间限制:1000ms

单点时限:1000ms

内存限制:256MB

---

Description - 题目描述

　　In country Light Tower, a presidential election is going on. There are two candidates,  Mr. X1 and Mr. X2, and both of them are not like good persons. One is called a liar and the other is called a maniac. They tear(Chinese English word, means defame) each other on TV face to face, on newspaper, on internet.......on all kinds of media. The country is tore into two parts because the people who support X1 are almost as many as the people who support X2.

　　After the election day, X1 and X2 get almost the same number of votes. No one gets enough votes to win. According to the law of the country, the Great Judge must decide who will be the president. But the judge doesn't want to offend half population of the country, so he randomly chooses a 6 years old kid Tom and authorize him to pick the president. Sounds weird? But the democracy in Light Tower is just like that.

　　The poor or lucky little kid Tom doesn't understand what is happening to his country. But he has his way to do his job. Tom's ao shu(Chinese English word, means some kind of weird math for kids) teacher just left him a puzzle a few days ago, Tom decide that he who solve that puzzle in a better way will be president. The ao shu teacher's puzzle is like this:

　　Given a string which consists of five digits('0'-'9'), like "02943", you should change "12345" into it by as few as possible operations. There are 3 kinds of operations:

　　 1. Swap two adjacent digits.

　　 2. Increase a digit by one. If the result exceed 9, change it to it modulo 10.

　　 3. Double a digit. If the result exceed 9, change it to it modulo 10.

　　You can use operation 2 at most three times, and use operation 3 at most twice.

　　As a melon eater(Chinese English again, means bystander), which candidate do you support? Please help him solve the puzzle.

    在灯塔国，一场总统选举正在举行。两个候选人为Mr. X1 与 Mr. X2，看起来都不咋的。一个疯子，一个骗子。他们在电视上、报纸上、网上……一切媒体上各种花式撕逼。因为双方的支持者数量相当，国家分成了两大派系。
    选举日之后，X1与X2拥有几乎相同的选票。没人拥有足够多的票数来赢得选举。根据本国法律，谁为总统将由大法官定夺。然而法官并不想得罪任何一半国民，因此他随机挑了个6岁的小朋友Tom，由他来选。神奇吗？灯塔国的民主就是这么神奇！
    伫足在命运车轮前的Tom不明觉厉。灵机一动，想起奥数老师几天前给自己留了道难题，Tom决定让能给出较优解的人当总统。奥数题如下：
    给定一个由五个数字(''-'')组成的字符串，比如""，你需要把""通过尽可能少的操作变成给定字符串。3种操作如下：
     .交换相邻两位数。
     .将一个数加一。如果结果大于9，则模10。
     .将一个数乘二。如果结果大于9，则模10。
    你最多只能使用操作2三次，操作3两次。
    作为一个吃瓜群众，你选谁，就帮谁搞定这个问题吧。

CN

Input - 输入

　　There are no more than 100,000 test cases.

　　Each test case is a string which consists of 5 digits.

    测试用例不超过10W组。
    每个测试用例为一串由5个数字组成的字符串。

CN

Output - 输出

　　For each case, print the minimum number of operations must be used to change "12345" into the given string. If there is no solution, print -1.

    对于每个测试用例，输出从""转换到给定串的最小操作数。若无解，则输出-。

CN

Sample Input - 样例输入

12435
99999
12374

Sample Output - 样例输出

1
-1
3

题解

　　花式枚举，次序全排列 + 数值枚举 + 位置枚举。
　　因为操作有顺序问题，把最多5次操作压入数组，用全排列枚举次序。
　　根据上面枚举出来的全排列，DFS搜索各个位置上可能出现的数值情况，压入队列。
　　（友情提示某人一开始想写5层循环，然后写到第二层就弃坑了……）
　　这个时候队列中已经有不少初始元素了，相邻位置两两交换，BFS搜索可能的情况，并更新。
　　（队列 == BFS ？ 雾 : 雾）

代码 C++

 #include<cstdio>
 #include <cstring>
 #include <algorithm>
 #include <queue>
 std::queue<int> q;
 int cnt[], wta[][], ts[] = { , , , ,  };
 
 void pushQ(int a, int c){
     if (c >= cnt[a]) return;
     cnt[a] = c;
     q.push(a);
 }
 void DFS(int iw, int it){
     if (iw == ){
         int sum = , j;
         for (j = ; j < ; ++j) sum = sum *  + wta[][j] % ;
         pushQ(sum, it);
         return;
     }
     if (iw) memcpy(wta[iw], wta[iw - ], sizeof ts);
     for (DFS(iw + , it); it < ; DFS(iw + , ++it)){
         if (ts[it]) wta[iw][iw] <<= ;
         else ++wta[iw][iw];
     }
 }
 void rdy(){
     memset(cnt, , sizeof(cnt));
     int i, j, now, c, tmp[];
     do{
         for (i = ; i < ; ++i) wta[][i] = i + ;
         DFS(, );
     } while (std::next_permutation(ts, ts + ));
 
     while (!q.empty()){
         c = now = q.front(); q.pop();
         for (i = ; ~i; --i){ tmp[i] = now % ; now /= ; }
         for (i = ; i < ; ++i){
             tmp[i] ^= tmp[i + ]; tmp[i + ] ^= tmp[i]; tmp[i] ^= tmp[i + ];
             for (j = now = ; j < ; ++j) now = now *  + tmp[j];
             pushQ(now, cnt[c] + );
             tmp[i] ^= tmp[i + ]; tmp[i + ] ^= tmp[i]; tmp[i] ^= tmp[i + ];
         }
     }
 }
 int main(){
     rdy();
     int opt;
     while (~scanf("%d", &opt)){
         if (cnt[opt] == cnt[]) puts("-1");
         else printf("%d\n", cnt[opt]);
     }
     return ;
 }