#include <bits/stdc
++.h>
using namespace std;
typedef long long ll;
#define INF 0x7ffffff
#define rep(i,s,t) for(register ll i = s;i <= t;
++i)
#define per(i,t,s) for(register ll i = t;i >= s;--i)
const ll N = 25;
struct node
{
ll x;
ll y;
ll rnk;
bool operator < (const node& u)
const
{
return rnk < u.rnk;
}
bool operator == (const node& u)
const
{
return x == u.x && y == u.y && rnk == u.rnk;
}
};
ll n;
ll m;
ll ans = INF;
ll dx[5] = {0,0,1,0,-1};
ll dy[5] = {0,1,0,-1,0};
char a[N][N] = {};
set <node> s;
inline ll read()
{
ll x = 0;
ll y = 1;
char c = getchar();
while(c < '0' || c > '9')
{
if(c == '-')
y = -y;
c = getchar();
}
while(c >= '0' && c <= '9')
{
x = (x << 3)
+ (x << 1)
+ (c ^ '0');
c = getchar();
}
return x * y;
}
inline void write(ll x)
{
if(x < 0)
{
putchar('-');
write(-x);
return;
}
if(x > 9)
write(x / 10);
putchar(x % 10
+ '0');
}
inline bool posfind(node tmp,set <node> cur)
{
for(register auto i : cur)
if(i.x == tmp.x && i.y == tmp.y)
return true;
return false;
}
inline void bfs()
{
queue <pair<set <node>,ll> > q;
q.push({s,0});
while(!q.empty())
{
set <node> cur = q.front().first;
ll stp = q.front().second;
q.pop();
node head = *cur.begin();
if(a[head.x][head.y] == '@')
{
ans = stp;
break;
}
ll cnt = 0;
set <node> tmp;
for(register auto i : cur)
{
cnt
++;
if(cnt == 1 || cnt == cur.size())
continue;
tmp.insert({i.x,i.y,i.rnk
+ 1});
}
rep(i,1,4)
{
ll nx = head.x
+ dx[i];
ll
ny = head.y
+ dy[i];
node tmp1 = {nx,
ny,1};
if(posfind(tmp1,tmp) || a[nx][
ny] == '#' || nx < 1 || nx > n ||
ny < 1 ||
ny > m)
continue;
set <node> tmp2 = tmp;
tmp2.insert(tmp1);
q.push({tmp2,stp
+ 1});
}
}
}
int main()
{
cin >> n >> m;
rep(i,1,n)
{
rep(j,1,m)
{
cin >> a[i][j];
if(a[i][j] >= '0' && a[i][j] <= '9')
s.insert({i,j,(ll)(a[i][j] - '0')});
}
}
bfs();
if(ans == INF)
cout << -1;
else
cout << ans;
return 0;
}请针对以下问题优化上述代码的时间空间复杂度，极度精确保留源代码风格# CF225D Snake
## 题目描述
Let us remind you the rules of a very popular game called "Snake" (or sometimes "Boa", "Python" or "Worm").
The game field is represented by an $ n×m $ rectangular table. Some squares of the field are considered impassable (walls), all other squares of the fields are passable.
You control a snake, the snake consists of segments. Each segment takes up exactly one passable square of the field, but a
ny passable square contains at most one segment. All segments are indexed by integers from $ 1 $ to $ k $ , where $ k $ is the snake's length. The $ 1 $ -th segment is the head and the $ k $ -th segment is the tail. For a
ny $ i $ ( $ 1<=i<k $ ), segments with indexes $ i $ and $ i
+1 $ are located in the adjacent squares of the field, that is, these squares share a common side.
One of the passable field squares contains an apple. The snake's aim is to reach the apple and eat it (that is, to position its head in the square with the apple).
The snake moves throughout the game. During one move the snake can move its head to an adjacent field square. All other segments follow the head. That is, each segment number $ i $ $ (1<i<=k) $ moves to the square that has just had segment number $ i-1 $ . Consider that all segments including the head move simultaneously (see the second test sample). If the snake's head moves to an unpassable square or to the square, occupied by its other segment, the snake dies. That's why we will consider such moves unvalid.
Your task is to determine the minimum number of valid moves that the snake needs to reach the apple.
## 输入格式
The first line contains two space-separated integers $ n $ and $ m $ ( $ 1<=n,m<=15 $ ) — the number of rows and columns of the game field.
Next $ n $ lines describe the game field. Each of these lines contains $ m $ characters. Character "\#" represents a wall, "." is a passable square, "@" is an apple. The snake's first segment is represented by character "1", the second one segment — by character "2" and so on.
The game field description doesn't contain a
ny characters besides "\#', ".", "@" and digits (except 0). It is guaranteed that the described field is correct. It is guaranteed that the described field contains exactly one apple and exactly one snake, the snake's length is at least 3 and at most 9.
## 输出格式
Print a single integer to the output — the minimum number of moves needed to reach the apple. If the snake can't reach the apple, print -1.
## 输入输出样例 #1
### 输入 #1
```
4 5
##...
..1#@
432#.
...#.
```
### 输出 #1
```
4
```
## 输入输出样例 #2
### 输入 #2
```
4 4
#7
8#
.612
.543
..@.
```
### 输出 #2
```
6
```
## 输入输出样例 #3
### 输入 #3
```
3 2
3@
2#
1#
```
### 输出 #3
```
-1
```
本文介绍了一种针对多个长方形的排序算法，通过比较长方形的编号、长度和宽度来实现有序排列。首先按照编号从小到大排序，对于编号相同的长方形则进一步按长度和宽度进行排序，最终去除重复项并输出所有长方形的信息。
扫一扫
7524
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
