제출 #716188

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
716188		shoryu386	Bitaro the Brave (JOI19_ho_t1)	C++17	50 / 100	552 ms	274432 KiB

joi2019_ho_t1

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

#define int long long

main(){
	int n, m; cin >> n >> m;
	char arr[n][m];
	for (int x = n-1; x > -1; x--){
		for (int y = 0; y < m; y++) cin >> arr[x][y];
	}
	
	int OpsumHori[n][m], OpsumVert[n][m], IpsumHori[n][m], IpsumVert[n][m];
	for (int x = 0; x < n; x++){
		OpsumHori[x][m-1] = (arr[x][m-1] == 'O');
		IpsumHori[x][m-1] = (arr[x][m-1] == 'I');
		for (int y = m-2; y > -1; y--){
			OpsumHori[x][y] = OpsumHori[x][y+1] + (arr[x][y] == 'O');
			IpsumHori[x][y] = IpsumHori[x][y+1] + (arr[x][y] == 'I');
		}
	}
	
	for (int y = 0; y < m; y++){
		OpsumVert[0][y] = (arr[0][y] == 'O');
		IpsumVert[0][y] = (arr[0][y] == 'I');
		for (int x = 1; x < n; x++){
			OpsumVert[x][y] = OpsumVert[x-1][y] + (arr[x][y] == 'O');
			IpsumVert[x][y] = IpsumVert[x-1][y] + (arr[x][y] == 'I');
		}
	}
	
	int ans = 0;
	for (int x = 0; x < n; x++){
		for (int y = 0; y < m; y++){
			if (arr[x][y] == 'J') ans += OpsumHori[x][y] * IpsumVert[x][y];
		}
	}
	
	cout << ans;
}

컴파일 시 표준 에러 (stderr) 메시지

joi2019_ho_t1.cpp:6:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    6 | main(){
      | ^~~~

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