답안 #714483

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
714483	2023-03-24T16:18:02 Z	Ninedesu	Bitaro the Brave (JOI19_ho_t1)	C++14	20 / 100	8 ms	6868 KB

joi2019_ho_t1

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

const int N=3001;
int n,m;
int cnt;
int sumO[N][N],sumI[N][N];
bool vis[N][N];
string arr[N],s;

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

  return 0;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	468 KB	Output is correct
5	Correct	1 ms	1236 KB	Output is correct
6	Correct	1 ms	1236 KB	Output is correct
7	Correct	1 ms	1236 KB	Output is correct
8	Correct	1 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	1108 KB	Output is correct

Subtask #2

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	468 KB	Output is correct
5	Correct	1 ms	1236 KB	Output is correct
6	Correct	1 ms	1236 KB	Output is correct
7	Correct	1 ms	1236 KB	Output is correct
8	Correct	1 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	1108 KB	Output is correct
14	Correct	7 ms	6228 KB	Output is correct
15	Correct	3 ms	3796 KB	Output is correct
16	Correct	4 ms	3668 KB	Output is correct
17	Correct	1 ms	468 KB	Output is correct
18	Correct	8 ms	6868 KB	Output is correct
19	Correct	6 ms	6676 KB	Output is correct
20	Incorrect	7 ms	6684 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	468 KB	Output is correct
5	Correct	1 ms	1236 KB	Output is correct
6	Correct	1 ms	1236 KB	Output is correct
7	Correct	1 ms	1236 KB	Output is correct
8	Correct	1 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	1108 KB	Output is correct
14	Correct	7 ms	6228 KB	Output is correct
15	Correct	3 ms	3796 KB	Output is correct
16	Correct	4 ms	3668 KB	Output is correct
17	Correct	1 ms	468 KB	Output is correct
18	Correct	8 ms	6868 KB	Output is correct
19	Correct	6 ms	6676 KB	Output is correct
20	Incorrect	7 ms	6684 KB	Output isn't correct
21	Halted	0 ms	0 KB	-