题目大意:有一个紧急开启密码锁的任务。密码由四位数字组成;每个数字从1到9;每次,可以对每一个数字进行加1或者减1;当从1加到9时,由9再加1会变为1;当从9减到1时,由1再减1会变为9;也可以交换两个相邻的数字,每次操作作为一个step。你的任务就是用最少的步骤解锁!
先来分析一下这道题目: (别人分析的,我觉得分析的好,摘抄一下)
- 首先考虑1234的下一step有可能是什么样的数字
- 针对每一位数字有四种操作,+1,-1,左交换,右交换(最左边的数字只有右交换,最右边只有左交换)
- 那么下一step的数字
- 第一数字位:2234,9234,2134
- 第二数字位:1334,1134,2134,1324
- 第三数字位:1244,1224,1324,1243
- 第四数字位:1235,1233,1243
//hdu1195 #include <stdio.h> #include <string.h> #include <algorithm> #include <queue> using namespace std; typedef struct In { char buf[5]; int step; }Data; Data cur, xx; queue<Data>q; int vist[10][10][10][10]; char buf1[5], buf2[5]; void bfs() { int i; memset(vist, 0, sizeof(vist)); while (!q.empty()) q.pop(); strcpy(cur.buf, buf1); cur.step = 0; q.push(cur); vist[cur.buf[0]-'0'][cur.buf[1]-'0'][cur.buf[2]-'0'][cur.buf[3]-'0'] = 1; while(!q.empty()) { xx = q.front(); q.pop(); for (i = 0; i <= 3; i++) { strcpy(cur.buf, xx.buf); cur.step = xx.step + 1; if (cur.buf[i] == '9') cur.buf[i] = '1'; else cur.buf[i] += 1; if (strcmp(cur.buf, buf2) == 0) { printf("%d\n", cur.step); return; } else if (vist[cur.buf[0]-'0'][cur.buf[1]-'0'][cur.buf[2]-'0'][cur.buf[3]-'0'] != 1) { q.push(cur); vist[cur.buf[0]-'0'][cur.buf[1]-'0'][cur.buf[2]-'0'][cur.buf[3]-'0'] = 1; } } for (i = 0; i <= 3; i++) { strcpy(cur.buf, xx.buf); cur.step = xx.step + 1; if (cur.buf[i] == '1') cur.buf[i] = '9'; else cur.buf[i] -= 1; if (strcmp(cur.buf, buf2) == 0) { printf("%d\n", cur.step); return; } else if (vist[cur.buf[0]-'0'][cur.buf[1]-'0'][cur.buf[2]-'0'][cur.buf[3]-'0'] != 1) { q.push(cur); vist[cur.buf[0]-'0'][cur.buf[1]-'0'][cur.buf[2]-'0'][cur.buf[3]-'0'] = 1; } } for (i = 0; i < 3; i++) { strcpy(cur.buf, xx.buf); cur.step = xx.step + 1; char c = cur.buf[i]; cur.buf[i] = cur.buf[i+1]; cur.buf[i+1] = c; if (vist[cur.buf[0]-'0'][cur.buf[1]-'0'][cur.buf[2]-'0'][cur.buf[3]-'0'] != 1) { if (strcmp(cur.buf, buf2) == 0) { printf("%d\n", cur.step); return; } else { vist[cur.buf[0]-'0'][cur.buf[1]-'0'][cur.buf[2]-'0'][cur.buf[3]-'0'] = 1; q.push(cur); } } } } } int main() { int cases; scanf("%d", &cases); while (cases--) { scanf("%s%s", buf1, buf2); if (strcmp(buf1, buf2) == 0) printf("0\n"); else bfs(); } return 0; }