Submission #328665

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
328665	2020-11-17 14:06:21	a_player	Bitaro the Brave (JOI19_ho_t1)	C++14	0 / 100	1 ms	492 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;
typedef long long ll;
const int nax=3e3+3;
char m[nax][nax];
vector<int> row[nax];
vector<int> col[nax];
int main(){
  int h,w;
  cin>>h>>w;
  for(int i=0;i<h;i++)
  for(int j=0;j<w;j++){
    cin>>m[i][j];
    if(m[i][j]=='O')row[i].push_back(j);
    if(m[i][j]=='I')col[j].push_back(i);
  }
  ll sol=0;
  for(int i=0;i<h;i++)
  for(int j=0;j<w;j++){
    if(m[i][j]=='J'){
      int p=lower_bound(row[j].begin(),row[j].end(),i)-row[j].begin();
      int q=lower_bound(col[i].begin(),col[i].end(),j)-col[i].begin();
      sol+=(ll)(row[j].size()-p)*(ll)(col[i].size()-q);
    }
  }
  cout<<sol<<endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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