难度:3
这道题用的bfs,因为这个方法比较通用,没有去分析题目内在的联系,
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
int n1 = 0, n2 = 0;
int ok = 0;
map<int, string> mp;
int dx[4][9] = {
{
6, 2, -2, 4, 0, -4, 2, -2, -6},
{
2, 4, 6, -2</