답안 #478916

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
478916	2021-10-09T06:18:14 Z	IvnF	Bitaro the Brave (JOI19_ho_t1)	C++14	20 / 100	7 ms	4924 KB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ull unsigned long long
#define fi first
#define se second
#define ld long double
ll n, m;
char arr[3005][3005], pi[3005][3005], po[3005][3005];

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j){
			cin >> arr[i][j];
		}
	}
	for(int j=1;j<=m;++j){
		for(int i=n;i>=1;--i){
			pi[i][j]=pi[i+1][j];
			pi[i][j]+=(arr[i][j]=='I');
		}
	}
	for(int i=1;i<=n;++i){
		for(int j=m;j>=1;--j){
			po[i][j]=po[i][j+1];
			po[i][j]+=(arr[i][j]=='O');
		}	
	}
	ll ans=0;
	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j){
			if(arr[i][j]=='J'){
				ans+=pi[i+1][j]*po[i][j+1];
			}
		}
	}
	cout << ans << '\n';
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	1228 KB	Output is correct
6	Correct	1 ms	1100 KB	Output is correct
7	Correct	1 ms	1100 KB	Output is correct
8	Correct	1 ms	1100 KB	Output is correct
9	Correct	2 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	1 ms	1228 KB	Output is correct
12	Correct	1 ms	1220 KB	Output is correct
13	Correct	1 ms	1100 KB	Output is correct

Subtask #2

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	1228 KB	Output is correct
6	Correct	1 ms	1100 KB	Output is correct
7	Correct	1 ms	1100 KB	Output is correct
8	Correct	1 ms	1100 KB	Output is correct
9	Correct	2 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	1 ms	1228 KB	Output is correct
12	Correct	1 ms	1220 KB	Output is correct
13	Correct	1 ms	1100 KB	Output is correct
14	Incorrect	7 ms	4924 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #3

0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	1228 KB	Output is correct
6	Correct	1 ms	1100 KB	Output is correct
7	Correct	1 ms	1100 KB	Output is correct
8	Correct	1 ms	1100 KB	Output is correct
9	Correct	2 ms	1100 KB	Output is correct
10	Correct	1 ms	1100 KB	Output is correct
11	Correct	1 ms	1228 KB	Output is correct
12	Correct	1 ms	1220 KB	Output is correct
13	Correct	1 ms	1100 KB	Output is correct
14	Incorrect	7 ms	4924 KB	Output isn't correct
15	Halted	0 ms	0 KB	-