#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=3010, LOG=20;
ll ans; // :))
int n, m, k, u, v, x, y, t, a, b;
char A[MAXN][MAXN];
int I[MAXN][MAXN], O[MAXN][MAXN];
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
cin>>n>>m;
for (int i=1; i<=n; i++) for (int j=1; j<=m; j++){
cin>>A[i][j];
if (A[i][j]=='I') I[i][j]=1;
if (A[i][j]=='O') O[i][j]=1;
}
for (int i=n; i; i--) for (int j=m; j; j--){
I[i][j]+=I[i+1][j];
O[i][j]+=O[i][j+1];
if (A[i][j]=='J') ans+=I[i][j]*O[i][j];
}
cout<<ans<<"\n";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
492 KB |
Output is correct |
5 |
Correct |
1 ms |
1516 KB |
Output is correct |
6 |
Correct |
1 ms |
1536 KB |
Output is correct |
7 |
Correct |
2 ms |
1388 KB |
Output is correct |
8 |
Correct |
2 ms |
1516 KB |
Output is correct |
9 |
Correct |
1 ms |
1516 KB |
Output is correct |
10 |
Correct |
1 ms |
1388 KB |
Output is correct |
11 |
Correct |
1 ms |
1516 KB |
Output is correct |
12 |
Correct |
1 ms |
1516 KB |
Output is correct |
13 |
Correct |
1 ms |
1388 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
492 KB |
Output is correct |
5 |
Correct |
1 ms |
1516 KB |
Output is correct |
6 |
Correct |
1 ms |
1536 KB |
Output is correct |
7 |
Correct |
2 ms |
1388 KB |
Output is correct |
8 |
Correct |
2 ms |
1516 KB |
Output is correct |
9 |
Correct |
1 ms |
1516 KB |
Output is correct |
10 |
Correct |
1 ms |
1388 KB |
Output is correct |
11 |
Correct |
1 ms |
1516 KB |
Output is correct |
12 |
Correct |
1 ms |
1516 KB |
Output is correct |
13 |
Correct |
1 ms |
1388 KB |
Output is correct |
14 |
Correct |
10 ms |
7532 KB |
Output is correct |
15 |
Correct |
3 ms |
5100 KB |
Output is correct |
16 |
Correct |
5 ms |
4332 KB |
Output is correct |
17 |
Correct |
1 ms |
492 KB |
Output is correct |
18 |
Correct |
12 ms |
8044 KB |
Output is correct |
19 |
Correct |
10 ms |
7916 KB |
Output is correct |
20 |
Correct |
10 ms |
7916 KB |
Output is correct |
21 |
Correct |
12 ms |
8044 KB |
Output is correct |
22 |
Correct |
10 ms |
7916 KB |
Output is correct |
23 |
Correct |
10 ms |
7916 KB |
Output is correct |
24 |
Correct |
13 ms |
8192 KB |
Output is correct |
25 |
Correct |
10 ms |
7916 KB |
Output is correct |
26 |
Correct |
10 ms |
7916 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
492 KB |
Output is correct |
5 |
Correct |
1 ms |
1516 KB |
Output is correct |
6 |
Correct |
1 ms |
1536 KB |
Output is correct |
7 |
Correct |
2 ms |
1388 KB |
Output is correct |
8 |
Correct |
2 ms |
1516 KB |
Output is correct |
9 |
Correct |
1 ms |
1516 KB |
Output is correct |
10 |
Correct |
1 ms |
1388 KB |
Output is correct |
11 |
Correct |
1 ms |
1516 KB |
Output is correct |
12 |
Correct |
1 ms |
1516 KB |
Output is correct |
13 |
Correct |
1 ms |
1388 KB |
Output is correct |
14 |
Correct |
10 ms |
7532 KB |
Output is correct |
15 |
Correct |
3 ms |
5100 KB |
Output is correct |
16 |
Correct |
5 ms |
4332 KB |
Output is correct |
17 |
Correct |
1 ms |
492 KB |
Output is correct |
18 |
Correct |
12 ms |
8044 KB |
Output is correct |
19 |
Correct |
10 ms |
7916 KB |
Output is correct |
20 |
Correct |
10 ms |
7916 KB |
Output is correct |
21 |
Correct |
12 ms |
8044 KB |
Output is correct |
22 |
Correct |
10 ms |
7916 KB |
Output is correct |
23 |
Correct |
10 ms |
7916 KB |
Output is correct |
24 |
Correct |
13 ms |
8192 KB |
Output is correct |
25 |
Correct |
10 ms |
7916 KB |
Output is correct |
26 |
Correct |
10 ms |
7916 KB |
Output is correct |
27 |
Correct |
299 ms |
88156 KB |
Output is correct |
28 |
Correct |
15 ms |
26092 KB |
Output is correct |
29 |
Correct |
17 ms |
7916 KB |
Output is correct |
30 |
Correct |
2 ms |
620 KB |
Output is correct |
31 |
Correct |
226 ms |
72812 KB |
Output is correct |
32 |
Correct |
246 ms |
88684 KB |
Output is correct |
33 |
Correct |
216 ms |
88428 KB |
Output is correct |
34 |
Correct |
257 ms |
84500 KB |
Output is correct |
35 |
Correct |
255 ms |
88684 KB |
Output is correct |
36 |
Correct |
215 ms |
88428 KB |
Output is correct |
37 |
Correct |
307 ms |
88812 KB |
Output is correct |
38 |
Correct |
190 ms |
72684 KB |
Output is correct |
39 |
Correct |
161 ms |
72556 KB |
Output is correct |