题解 [NOI2001][LuoguP1949]聪明的打字员

link
广搜即可，每个状态 $f_{a,b}$，$a$ 为密码，$b$ 为光标位置，复杂度 $O(n10^n)$，能过。
正解要双向 BFS，不用的话吸个氧也能过。

//P1949
#include <bits/stdc++.h>
using namespace std;

const int p10[] = {1, 10, 100, 1000, 10000, 100000, 1000000};
int ans[1000000][7], st, ed;
queue<pair<int, int> > q;

int swp(int num, int a, int b){
	if(a == b) return 0;
	int x = num % p10[a] / p10[a-1];
	int y = num % p10[b] / p10[b-1];
	return num - x*p10[a-1] - y*p10[b-1] + x*p10[b-1] + y*p10[a-1];
}
int add(int num, int pos, int val){
	int x = num % p10[pos] / p10[pos-1];
	if(x + val > 9 || x + val < 0) return 0;
	return num + val*p10[pos-1];
}
int mve(int pos, int val){
	if(pos + val > 6 || pos + val < 0) return 0;
	return pos + val;
}

int main(){
	scanf("%d%d", &st, &ed);
	memset(ans, -1, sizeof(ans));
	q.push(make_pair(st, 6)), ans[st][6] = 0;
	while(!q.empty()){
		int num = q.front().first, pos = q.front().second, now = ans[num][pos]; q.pop();
//		printf("%d %d %d\n", num, pos, now);
		if(num == ed){ printf("%d\n", now); return 0; }
		int nn = swp(num, 1, pos);
		if(nn && ans[nn][pos] == -1) ans[nn][pos] = now + 1, q.push(make_pair(nn, pos));
		nn = swp(num, pos, 6);
		if(nn && ans[nn][pos] == -1) ans[nn][pos] = now + 1, q.push(make_pair(nn, pos));
		nn = add(num, pos, 1);
		if(nn && ans[nn][pos] == -1) ans[nn][pos] = now + 1, q.push(make_pair(nn, pos));
		nn = add(num, pos, -1);
		if(nn && ans[nn][pos] == -1) ans[nn][pos] = now + 1, q.push(make_pair(nn, pos));
		nn = mve(pos, 1);
		if(nn && ans[num][nn] == -1) ans[num][nn] = now + 1, q.push(make_pair(num, nn));
		nn = mve(pos, -1);
		if(nn && ans[num][nn] == -1) ans[num][nn] = now + 1, q.push(make_pair(num, nn));
	}
	return 0;
}