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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
| #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int h, w;
int sax, say, sbx, sby, gax, gay, gbx, gby;
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
bool used[55][55][55][55];
bool can(int y, int x) {
if(0 <= y && y < h && 0 <= x && x < w) return true;
return false;
}
int main() {
while(cin >> w >> h) {
if(w == 0 && h == 0) break;
string A[h], B[h];
rep(i, h) cin >> A[i] >> B[i];
rep(i, h) reverse(B[i].begin(), B[i].end());
rep(i, h) {
rep(j, w) {
if(A[i][j] == 'L') {
say = i;
sax = j;
A[i][j] = '.';
}
if(B[i][j] == 'R') {
sby = i;
sbx = j;
B[i][j] = '.';
}
if(A[i][j] == '%') {
gay = i;
gax = j;
A[i][j] = '.';
}
if(B[i][j] == '%') {
gby = i;
gbx = j;
B[i][j] = '.';
}
}
}
queue<pair< P, P > > que;
que.push(mp( mp(say, sax), mp(sby, sbx) ));
memset(used, 0, sizeof(used));
used[say][sax][sby][sbx] = true;
bool flag = false;
while(que.size()) {
pair<P, P> p = que.front(); que.pop();
int ay = p.first.first, ax = p.first.second;
int by = p.second.first, bx = p.second.second;
if(ay == gay && ax == gax && by == gby && bx == gbx) {
flag = true;
break;
}
if((ay == gay && ax == gax) || (by == gby && bx == gbx)) {
continue;
}
rep(i, 4) {
int nay = ay + dy[i];
int nax = ax + dx[i];
int nby = by + dy[i];
int nbx = bx + dx[i];
if(!can(nay, nax) || A[nay][nax] == '#') {
nay -= dy[i];
nax -= dx[i];
}
if(!can(nby, nbx) || B[nby][nbx] == '#') {
nby -= dy[i];
nbx -= dx[i];
}
if(!used[nay][nax][nby][nbx]) {
que.push(mp( mp(nay, nax), mp(nby, nbx) ));
used[nay][nax][nby][nbx] = true;
}
}
}
if(flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
|