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
//2022-12-18
//author: Marcin Rolbiecki
#include <bits/stdc++.h>
using namespace std;

const int maxN = 10;

int n, m;
int xp, yp, xk, yk;

int ruchy [maxN][maxN];
int sum;

int main () {
		
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m;
	
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++) {
			char ch; cin >> ch;
			if (ch == 'O') {
				xp = j;
				yp = i;
			}
			ruchy[i][j] = 4;
			if (i == 0) ruchy[i][j]--;
			if (i == n-1) ruchy[i][j]--;
			if (j == 0) ruchy[i][j]--;
			if (j == m-1) ruchy[i][j]--;
		}
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++) {
			char ch; cin >> ch;
			if (ch == 'O') {
				xk = j;
				yk = i;
			}
		}
		
	bool parity = (xp % 2 == yp % 2);
	
	if ((xk % 2 == yk % 2) != parity) {
		cout << 0;
		return 0;
	}
		
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			if ((i % 2 == j % 2) == parity)
				sum += ruchy[i][j];
				
	if (sum == ruchy[yk][xk]) {
		cout << 1;
		return 0;
	}
	
	cout << setprecision (14) << (long double)ruchy[yk][xk] / sum;
	
	return 0;
}