1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
| #include <iostream> // standard input & output cout cin#include <cstdio> // scanf printfsssss#include <vector> // std::vector#include <algorithm>#include <string> // std::string#include <queue> // std::queue#include <cstring> // memset#include <set> // std::set#include <utility> // std::pair, std::make_pair#include <map>#include <list>#include <stack>#include <deque>#include <cmath>#include <climits>#include <cassert>using namespace std;#define fi first#define se second#define mp make_pair#define pb push_backtypedef long long ll;typedef pair<ll, ll> ii;typedef vector<int> vi;typedef long double ld;#define mod 1000000007const char newline = '\n';const int dy[4] = {-1,0,0,1};const int dx[4] = {0,-1,1,0};ll powmod(ll a, ll b) {ll res=1; a %= mod; assert(b >= 0); for(; b; b >>= 1) {if (b & 1) res = res * a % mod; a = a * a % mod;} return res;}const int N = 1001;char board[N][N];bool visited[N][N][2];int n,m;int main(int argc, char **argv){ ios_base::sync_with_stdio(false); cin.tie(0); cin>>n>>m; for(int i = 0; i < n ; i++) { cin>>board[i]; } memset(visited, false, sizeof(visited)); queue<tuple<int, int, int, int > > q; q.push(make_tuple(0,0,1,1)); while(!q.empty()) { int y,x,can,dist; tie(y,x,can,dist) = q.front(); q.pop(); visited[y][x][can] = true; if(y == n-1 && x == m-1) { cout<<dist<<newline; return 0; } for(int i = 0 ; i < 4; i ++) { int ny, nx; ny = y + dy[i]; nx = x + dx[i]; if(ny >= 0 && ny < n && nx >= 0 && nx < m && !visited[ny][nx][can]) { if(board[ny][nx] == '0') q.push(make_tuple(ny,nx,can,dist+1)); if(board[ny][nx] == '1' && can) q.push(make_tuple(ny, nx, 0, dist+1)); } } } cout<<-1<<newline; return 0;}
bfs 할때 메모리초과가 뜨면 visited 배열 만들어 줬는지 살펴보기
|