-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
103 lines (95 loc) · 2.21 KB
/
Copy pathmain.cpp
File metadata and controls
103 lines (95 loc) · 2.21 KB
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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
#include <iostream>
#include <queue>
#define MAX_SIZE 51
using namespace std;
typedef struct _Point {
int r, c;
int dir;
} Point;
Point robot;
queue<Point> q;
int N, M, ans;
int map[MAX_SIZE][MAX_SIZE];
bool cleaned[MAX_SIZE][MAX_SIZE];
int dr[] = {-1, 0, 1, 0};
int dc[] = {0, 1, 0, -1};
/*
0 1 2 3
북 동 남 서
*/
// turn = (dir+3) % 4
bool isOut(int nr, int nc) {
return (nr < 1 || nr >= N-1 || nc < 1 || nc >= M-1);
}
int opp(int dir) {
if(dir == 0) return 2;
else if(dir == 1) return 3;
else if(dir == 2) return 0;
else return 1;
}
void dfs(Point p) {
int r = p.r;
int c = p.c;
int dir = p.dir;
cleaned[r][c] = true;
ans++;
for(int i=0; i<4; i++) {
int ndir = (dir+3) % 4;
int nr = r + dr[ndir];
int nc = c + dc[ndir];
if(isOut(nr, nc) || cleaned[nr][nc]) continue;
dfs(Point{nr,nc,ndir});
return;
}
int ndir = (dir+2) % 4;
int nr = r + dr[ndir];
int nc = c + dc[ndir];
if(map[nr][nc] == 1) return;
else dfs(Point{nr,nc,dir});
}
// delete
void clean() {
while(!q.empty()) {
int r = q.front().r;
int c = q.front().c;
int dir = q.front().dir;
q.pop();
// 1. lookup for 4 directions
bool flag = false;
for(int i=0; i<4; i++) {
int ndir = (dir + 3) % 4;
int nr = r + dr[ndir];
int nc = c + dc[ndir];
if(isOut(nr, nc)) continue;
if(cleaned[nr][nc] || map[nr][nc] != 0) continue;
flag = true;
cleaned[nr][nc] = true;
q.push(Point{nr,nc,ndir});
ans++;
break;
}
if(!flag) {
int ndir = opp(dir);
int nr = r + dr[ndir];
int nc = c + dc[ndir];
if(map[nr][nc] == 1) break;
q.push(Point{nr, nc, dir});
}
}
}
int main() {
cin >> N >> M;
cin >> robot.r >> robot.c >> robot.dir;
q.push(robot);
cleaned[robot.r][robot.c] = true;
ans = 1;
for(int i=0; i<N; i++) {
for(int j=0; j<N; j++) {
cin >> map[i][j];
}
}
//clean();
dfs(robot);
cout << ans << '\n';
return 0;
}