Submission #719999

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
719999	2023-04-07T08:31:44 Z	vjudge1	Bitaro the Brave (JOI19_ho_t1)	C++17	20 / 100	7 ms	6836 KB

joi2019_ho_t1

#include<bits/stdc++.h>
using namespace std;

const int N=3001;
int n,m;
int cnt;
string mp[N],s;
int I[N][N],O[N][N];

int main(){
  ios_base::sync_with_stdio(0),cin.tie(0);
  cin >> n >> m;
  for(int i=1; i<=n; i++){
    cin >> s;
    mp[i]="x"+s;
  }
  for(int i=1; i<=n; i++){
    for(int j=m; j>=1; j--){
      O[i][j]=O[i][j+1];
      if(mp[i][j]=='O')O[i][j]++;
    }
  }
  for(int j=1; j<=m; j++){
    for(int i=n; i>=1; i--){
      I[i][j]=I[i+1][j];
      if(mp[i][j]=='I')I[i][j]++;
    }
  }
  for(int i=1; i<=n; i++){
    for(int j=1; j<=m; j++){
      if(mp[i][j]=='J')cnt+=I[i][j]*O[i][j];
    }
  }
  cout << cnt;

  return 0;
}

/*
J--O
| /
I
*/

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	420 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	1 ms	1236 KB	Output is correct
6	Correct	2 ms	1196 KB	Output is correct
7	Correct	1 ms	1204 KB	Output is correct
8	Correct	2 ms	1236 KB	Output is correct
9	Correct	1 ms	1192 KB	Output is correct
10	Correct	1 ms	1108 KB	Output is correct
11	Correct	1 ms	1236 KB	Output is correct
12	Correct	1 ms	1236 KB	Output is correct
13	Correct	1 ms	1236 KB	Output is correct

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	420 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	1 ms	1236 KB	Output is correct
6	Correct	2 ms	1196 KB	Output is correct
7	Correct	1 ms	1204 KB	Output is correct
8	Correct	2 ms	1236 KB	Output is correct
9	Correct	1 ms	1192 KB	Output is correct
10	Correct	1 ms	1108 KB	Output is correct
11	Correct	1 ms	1236 KB	Output is correct
12	Correct	1 ms	1236 KB	Output is correct
13	Correct	1 ms	1236 KB	Output is correct
14	Correct	6 ms	6328 KB	Output is correct
15	Correct	2 ms	3796 KB	Output is correct
16	Correct	3 ms	3668 KB	Output is correct
17	Correct	1 ms	468 KB	Output is correct
18	Correct	7 ms	6836 KB	Output is correct
19	Correct	5 ms	6740 KB	Output is correct
20	Incorrect	5 ms	6740 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	420 KB	Output is correct
4	Correct	1 ms	468 KB	Output is correct
5	Correct	1 ms	1236 KB	Output is correct
6	Correct	2 ms	1196 KB	Output is correct
7	Correct	1 ms	1204 KB	Output is correct
8	Correct	2 ms	1236 KB	Output is correct
9	Correct	1 ms	1192 KB	Output is correct
10	Correct	1 ms	1108 KB	Output is correct
11	Correct	1 ms	1236 KB	Output is correct
12	Correct	1 ms	1236 KB	Output is correct
13	Correct	1 ms	1236 KB	Output is correct
14	Correct	6 ms	6328 KB	Output is correct
15	Correct	2 ms	3796 KB	Output is correct
16	Correct	3 ms	3668 KB	Output is correct
17	Correct	1 ms	468 KB	Output is correct
18	Correct	7 ms	6836 KB	Output is correct
19	Correct	5 ms	6740 KB	Output is correct
20	Incorrect	5 ms	6740 KB	Output isn't correct
21	Halted	0 ms	0 KB	-