-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathE.java
More file actions
169 lines (148 loc) · 4.82 KB
/
Copy pathE.java
File metadata and controls
169 lines (148 loc) · 4.82 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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
package atcoder.hhkb2020;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Random;
import java.util.StringTokenizer;
public final class E {
private static final int MOD = (int) (1e9 + 7);
public static void main(String[] args) {
final FastScanner fs = new FastScanner();
final int n = fs.nextInt();
final int m = fs.nextInt();
final char[][] grid = new char[n][m];
int lamps = 0;
for (int i = 0; i < n; i++) {
grid[i] = fs.next().toCharArray();
for (char c : grid[i]) {
lamps += c == '.' ? 1 : 0;
}
}
final int[][] row = getRow(n, m, grid);
final int[][] col = getCol(n, m, grid);
long res = 0;
final long[] pow = new long[(int) (4e6 + 5)];
pow[0] = 1;
for (int i = 1; i < pow.length; i++) {
pow[i] = (pow[i - 1] * 2) % MOD;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (grid[i][j] != '#') {
final int x = row[i][j] + col[i][j] - 1;
final int y = lamps - x;
final long curr = ((pow[x] - 1) * pow[y]) % MOD;
res = (res + curr) % MOD;
}
}
}
System.out.println(res);
}
private static int[][] getRow(int n, int m, char[][] grid) {
final int[][] row = new int[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (grid[i][j] == '#') {
row[i][j] = -1;
} else {
int tt = j;
while (tt < m && grid[i][tt] == '.') {
tt++;
}
for (int k = j; k < tt; k++) {
row[i][k] = tt - j;
}
j = tt - 1;
}
}
}
return row;
}
private static int[][] getCol(int n, int m, char[][] grid) {
final int[][] col = new int[n][m];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (grid[j][i] == '#') {
col[j][i] = -1;
} else {
int tt = j;
while (tt < n && grid[tt][i] == '.') {
tt++;
}
for (int k = j; k < tt; k++) {
col[k][i] = tt - j;
}
j = tt - 1;
}
}
}
return col;
}
static final class Utils {
public static void shuffleSort(int[] arr) {
shuffle(arr);
Arrays.sort(arr);
}
public static void shuffleSort(long[] arr) {
shuffle(arr);
Arrays.sort(arr);
}
public static void shuffle(int[] arr) {
final Random r = new Random();
for (int i = 0; i <= arr.length - 2; i++) {
final int j = i + r.nextInt(arr.length - i);
swap(arr, i, j);
}
}
public static void shuffle(long[] arr) {
final Random r = new Random();
for (int i = 0; i <= arr.length - 2; i++) {
final int j = i + r.nextInt(arr.length - i);
swap(arr, i, j);
}
}
public static void swap(int[] arr, int i, int j) {
final int t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
public static void swap(long[] arr, int i, int j) {
final long t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
private Utils() {}
}
static class FastScanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
private String next() {
while (!st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
//noinspection CallToPrintStackTrace
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
int[] nextIntArray(int n) {
final int[] a = new int[n];
for (int i = 0; i < n; i++) { a[i] = nextInt(); }
return a;
}
long[] nextLongArray(int n) {
final long[] a = new long[n];
for (int i = 0; i < n; i++) { a[i] = nextLong(); }
return a;
}
}
}