2021ICPC沈阳 J Luggage Lock（BFS）

链接

题目描述

Eileen has a big luggage and she would pick a lot of things in the luggage every time when A-SOUL goes out for a show. However, if there are too many things in the luggage, the 4-digit password lock on the luggage will be hard to rotate.

The state of lock is the four digits on the lock. In one step, she can choose consecutive digits to rotate up by one simultaneously or down by one simultaneously. For example, she can rotate $\text{0000}$ to $\text{0111}$ or $\text{0900}$ in one step because the rotated digits are consecutive, but she can’t rotate $\text{0000}$ to $\text{0101}$ in one step. Since she has little strength, she wants to rotate the lock as few times as possible.

Now the lock is at state $a_0{a}_1{a}_2{a}_3$ and the password is $b_0{b}_1{b}_2{b}_3$ . As a fan of A-SOUL, you are asked to help Eileen find out the optimal plan to unlock but you only need to tell Eileen how many times she has to rotate.

输入描述:

The first line contains one integer $T$ $(1\le T\le 10^5)$, denoting the numer of test cases.

Each of the test cases contains a line containing the initial state $a_0{a}_1{a}_2{a}_3$ and the target state $b_0{b}_1{b}_2{b}_3$.

输出描述:

For each test case, output a line containing a single integer, denoting the minimum steps needed to unlock.

输入

6
1234 2345
1234 0123
1234 2267
1234 3401
1234 1344
1234 2468

输出

1
1
4
5
1
4

思路

从 $a_0{a}_1{a}_2{a}_3$ 转换为 $b_0{b}_1{b}_2{b}_3$ ，相当于从 $\text{0000}$ 转换到 $c_0{c}_1{c}_2{c}_3$。

每次操作，相当于进行一次区间修改。从 $\text{0000}$ 到 $\text{0110}$ 就是对$[1,2]$ 这个区间整体加 $1$。每次操作，都可以选择 10 个区间：
$$[0,0]、[0,1]、[0,2]、[0,3]、[1,1]、[1,2]、[1,3]、[2,2]、[2,3]、[3,3]$$
对每个区间，都有 2 种拨码方法（向上或向下拨一格）。

所以，每个数 $a_0{a}_1{a}_2{a}_3$ 进行一次操作可以转换为另外 $20$ 个数字。

把 $\text{0000}$ 到 $\text{9999}$ 看作一万个结点，每个结点有 $20$ 条边，每条边的长度为 $1$。那么，从 $\text{0000}$ 转换为 $c_0{c}_1{c}_2{c}_3$ 的最少步骤，就等于这张无向图上 $\text{0000}$ 到 $c_0{c}_1{c}_2{c}_3$ 的最短路径。

BFS 一遍即可得到答案。

#include<bits/stdc++.h>
using namespace std;
const int power[5]={1,10,100,1000};
queue<int> que;
int f[10000],a[10],T,vis[10000];

int calc(int x,int l,int r,int k){
	for(int i=0;i<=3;i++){ a[i]=x%10; x/=10; }
	for(int i=l;i<=r;i++) a[i]=(a[i]+10+k)%10;
	for(int i=0;i<=3;i++) x+=a[i]*power[i];
	return x;
}

void solve(){
	string x,y; int num=0;
	cin>>x>>y;
	for(int i=0;i<=3;i++) x[i]=(x[i]-y[i]+10)%10;
	for(int i=0;i<=3;i++) num+=x[i]*power[3-i];
	cout<<f[num]<<"\n";
}

int main(){
	ios::sync_with_stdio(false);
	memset(f,0x3f,sizeof(f)); f[0]=0;
	que.push(0); vis[0]=1;
	while(que.size()){
		int x=que.front(); que.pop();
		for(int i=0;i<=3;i++){
			for(int j=i;j<=3;j++){
				for(int k=0;k<=1;k++){
					int y=calc(x,i,j,-2*(k==0)+1);
					f[y]=min(f[y],f[x]+1);
					if(!vis[y]) que.push(y);
					vis[y]=1;
				}
			}
		}
	}
	for(cin>>T;T;T--) solve();
}

函数 int calc(int x,int l,int r,int k) 的作用是，返回 $x$ 这个数的 $[l,r]$ 区间整体加 $k$ 后得到的数字。