Submission #98203

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
98203	2019-02-21 13:48:50	scanhex	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	192 ms	80648 KiB

joi2019_ho_t1

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
#include <bits/stdc++.h>
using namespace std;
using nagai = long long;
#define sz(x) int((x).size())
const int N=3003;
string ss[N];
int cri[N][N],cdo[N][N];
int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n,m;
  cin>>n>>m;
  for(int i=0;i<n;++i)cin>>ss[i];
  for(int i=0;i<n;++i)
    for(int j=m-1;j>=0;j--)
      if(j==m-1)cri[i][j]=(ss[i][j]=='O');else cri[i][j]=(ss[i][j]=='O')+cri[i][j+1];
  nagai ans=0;
  for(int i=n-1;i>=0;--i)
    for(int j=0;j<m;++j){
      if(i==n-1)cdo[i][j]=(ss[i][j]=='I');else cdo[i][j]=(ss[i][j]=='I')+cdo[i+1][j];
      if(ss[i][j]=='J')
        ans+=cdo[i][j]*cri[i][j];
    }
  cout<<ans<<'\n';
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50