#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
void setIO() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int32_t main() {
setIO();
int n, m;
cin >> n >> m;
char mat[n][m];
for(int i=0; i<n; i++)
for(int j=0; j<m; j++) cin >> mat[i][j];
ll ans = 0;
int hor[n][m], ver[m][n];
memset(hor, 0, sizeof(hor));
memset(ver, 0, sizeof(ver));
for(int i=0; i<n; i++) {
for(int j=0; j<m; j++) {
hor[i][j] = (mat[i][j] == 'O');
if(j) hor[i][j] += hor[i][j-1];
}
}
for(int j=0; j<m; j++) {
for(int i=0; i<n; i++) {
ver[j][i] = (mat[i][j] == 'I');
if(i) ver[j][i] += ver[j][i-1];
}
}
for(int i=0; i<n; i++) {
for(int j=0; j<m; j++) {
if(mat[i][j] == 'J') {
int h = hor[i][m-1];
if(j) h -= hor[i][j-1];
int v = ver[j][n-1];
if(i) v -= ver[j][i-1];
ans += h * v;
}
}
}
cout << ans << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
0 ms |
348 KB |
Output is correct |
14 |
Correct |
6 ms |
2140 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
3 ms |
1712 KB |
Output is correct |
17 |
Correct |
1 ms |
348 KB |
Output is correct |
18 |
Correct |
6 ms |
2652 KB |
Output is correct |
19 |
Correct |
5 ms |
2652 KB |
Output is correct |
20 |
Correct |
5 ms |
2652 KB |
Output is correct |
21 |
Correct |
6 ms |
2908 KB |
Output is correct |
22 |
Correct |
5 ms |
2652 KB |
Output is correct |
23 |
Correct |
6 ms |
2652 KB |
Output is correct |
24 |
Correct |
6 ms |
2652 KB |
Output is correct |
25 |
Correct |
5 ms |
2652 KB |
Output is correct |
26 |
Correct |
5 ms |
2652 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
0 ms |
348 KB |
Output is correct |
14 |
Correct |
6 ms |
2140 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
3 ms |
1712 KB |
Output is correct |
17 |
Correct |
1 ms |
348 KB |
Output is correct |
18 |
Correct |
6 ms |
2652 KB |
Output is correct |
19 |
Correct |
5 ms |
2652 KB |
Output is correct |
20 |
Correct |
5 ms |
2652 KB |
Output is correct |
21 |
Correct |
6 ms |
2908 KB |
Output is correct |
22 |
Correct |
5 ms |
2652 KB |
Output is correct |
23 |
Correct |
6 ms |
2652 KB |
Output is correct |
24 |
Correct |
6 ms |
2652 KB |
Output is correct |
25 |
Correct |
5 ms |
2652 KB |
Output is correct |
26 |
Correct |
5 ms |
2652 KB |
Output is correct |
27 |
Correct |
219 ms |
79440 KB |
Output is correct |
28 |
Correct |
1 ms |
604 KB |
Output is correct |
29 |
Correct |
13 ms |
6472 KB |
Output is correct |
30 |
Correct |
1 ms |
600 KB |
Output is correct |
31 |
Correct |
148 ms |
58704 KB |
Output is correct |
32 |
Correct |
188 ms |
83536 KB |
Output is correct |
33 |
Correct |
196 ms |
84028 KB |
Output is correct |
34 |
Correct |
173 ms |
67932 KB |
Output is correct |
35 |
Correct |
207 ms |
83528 KB |
Output is correct |
36 |
Correct |
205 ms |
84028 KB |
Output is correct |
37 |
Correct |
226 ms |
84308 KB |
Output is correct |
38 |
Correct |
126 ms |
58212 KB |
Output is correct |
39 |
Correct |
131 ms |
58448 KB |
Output is correct |