分析：
显而易见，这是一道构造题
题目要求构造出一种地图方案，使得推箱子的步数大于 \(40k\) ，然而 \(N+M\) 最大只有可怜的 \(100\) ，那么我们就需要开始思考了
稍微分析一下，如果整张图的格子不够走，那么必须要让人能够巨多的重复步数才能达到目标
观察样例：
....SS
....SS
.#BB#.
..BB.P
......
我们想到：箱子的大小是 \(2×2\) ,而人是 \(1×1\) ，那么一定有只有人能走而箱子走不了的情况
显然，一种思路是让人不断地走圈子去走到一个能推动箱子的地方，从而去推动箱子
有了这个思路后答案就很显然了：我们可以构造出一个由很多小房间的地图，这些小房间只有两个口，一个长 \(2\)，让箱子正好能出去，一个长 \(1\)，让人能走但箱子走不了，从而达到人绕远路去推箱子的目的
Code
#include <bits/stdc++.h>
using namespace std;
int main(){
cout <<"49 51"<<endl;
cout<< "......#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".#.#BBP..#.#.#...............#.#.#...............#."<<endl;
cout<< ".#..BB.....#...................#..................."<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".#######..###..#############..###..#############..#"<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".#.#.......#.......#.#.#.......#.......#.#.#......."<<endl;
cout<< ".#.......#.#.#.......#.......#.#.#.......#.......#."<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".##..#############..###..#############..###..######"<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".#.......#.#.#.......#.......#.#.#.......#.......#."<<endl;
cout<< ".#.#.......#.......#.#.#.......#.......#.#.#......."<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".#######..###..#############..###..#############..#"<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".#.#.......#.......#.#.#.......#.......#.#.#......."<<endl;
cout<< ".#.......#.#.#.......#.......#.#.#.......#.......#."<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".##..#############..###..#############..###..######"<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".#...................#...................#.......#."<<endl;
cout<< ".#.#...............#.#.#...............#.#.#......."<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".###############################################..#"<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".#.#...............#.#.#...............#.#.#......."<<endl;
cout<< ".#...................#...................#.......#."<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".##..#############..###..#############..###..######"<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".#.......#.#.#.......#.......#.#.#.......#.......#."<<endl;
cout<< ".#.#.......#.......#.#.#.......#.......#.#.#......."<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".#######..###..#############..###..#############..#"<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".#.#.......#.......#.#.#.......#.......#.#.#......."<<endl;
cout<< ".#.......#.#.#.......#.......#.#.#.......#.......#."<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".##..#############..###..#############..###..######"<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".#.......#.#.#.......#.......#.#.#.......#.......#."<<endl;
cout<< ".#.#.......#.......#.#.#.......#.......#.#.#......."<<endl;
cout<< ".#....#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".#######..###..#############..###..#############..#"<<endl;
cout<< ".#SS..#....#....#....#....#....#....#....#....#...."<<endl;
cout<< ".#SS.......#...................#..................."<<endl;
cout<< ".#.......#.#.#...............#.#.#...............#."<<endl;
cout<< "...####....#....#....#....#....#....#....#....#....";
return 0;
}
这图构造的我真痛苦啊！