답안 #862545

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
862545	2023-10-18T13:16:41 Z	Ninedesu	Bitaro the Brave (JOI19_ho_t1)	C++14	20 / 100	5 ms	10076 KB

joi2019_ho_t1

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

const int N=3002;
int n,m;
int ans;
int dpi[N][N],dpo[N][N];
string s,mp[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=n; i>=1; i--){
        for(int j=1; j<=m; j++){
            dpi[i][j]=dpi[i+1][j];
            if(mp[i][j]=='I')dpi[i][j]++;
        }
    }
    for(int j=m; j>=1; j--){
        for(int i=1; i<=n; i++){
            dpo[i][j]=dpo[i][j+1];
            if(mp[i][j]=='O')dpo[i][j]++;
        }
    }
    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            if(mp[i][j]=='J'&&dpi[i][j]&&dpo[i][j])ans+=dpi[i][j]*dpo[i][j];
        }
    }
    cout << ans;

    return 0;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	556 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	604 KB	Output is correct
5	Correct	1 ms	1372 KB	Output is correct
6	Correct	1 ms	1368 KB	Output is correct
7	Correct	1 ms	1372 KB	Output is correct
8	Correct	1 ms	1372 KB	Output is correct
9	Correct	1 ms	1368 KB	Output is correct
10	Correct	1 ms	1184 KB	Output is correct
11	Correct	1 ms	1372 KB	Output is correct
12	Correct	1 ms	1372 KB	Output is correct
13	Correct	1 ms	1116 KB	Output is correct

Subtask #2

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	556 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	604 KB	Output is correct
5	Correct	1 ms	1372 KB	Output is correct
6	Correct	1 ms	1368 KB	Output is correct
7	Correct	1 ms	1372 KB	Output is correct
8	Correct	1 ms	1372 KB	Output is correct
9	Correct	1 ms	1368 KB	Output is correct
10	Correct	1 ms	1184 KB	Output is correct
11	Correct	1 ms	1372 KB	Output is correct
12	Correct	1 ms	1372 KB	Output is correct
13	Correct	1 ms	1116 KB	Output is correct
14	Correct	4 ms	9816 KB	Output is correct
15	Correct	2 ms	6748 KB	Output is correct
16	Correct	2 ms	5040 KB	Output is correct
17	Correct	0 ms	552 KB	Output is correct
18	Correct	5 ms	10076 KB	Output is correct
19	Correct	4 ms	10072 KB	Output is correct
20	Incorrect	4 ms	9052 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	556 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	604 KB	Output is correct
5	Correct	1 ms	1372 KB	Output is correct
6	Correct	1 ms	1368 KB	Output is correct
7	Correct	1 ms	1372 KB	Output is correct
8	Correct	1 ms	1372 KB	Output is correct
9	Correct	1 ms	1368 KB	Output is correct
10	Correct	1 ms	1184 KB	Output is correct
11	Correct	1 ms	1372 KB	Output is correct
12	Correct	1 ms	1372 KB	Output is correct
13	Correct	1 ms	1116 KB	Output is correct
14	Correct	4 ms	9816 KB	Output is correct
15	Correct	2 ms	6748 KB	Output is correct
16	Correct	2 ms	5040 KB	Output is correct
17	Correct	0 ms	552 KB	Output is correct
18	Correct	5 ms	10076 KB	Output is correct
19	Correct	4 ms	10072 KB	Output is correct
20	Incorrect	4 ms	9052 KB	Output isn't correct
21	Halted	0 ms	0 KB	-