제출 #818774

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

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define el cout<<endl;
#define fr(n,m) for(int i=n;i<m;i++)
#define frj(n,m) for(int j=n;j<m;j++)
#define frl(n,m) for(int l=n;l<m;l++)
#define frd(n,m) for(int d=n;d<m;d++)
#define mii map<int,int>
#define mci map<char,int>
#define vi vector<int>
#define vc vector<char>
#define mivi map<int,vi>
const int mod = 1e9 + 7;
// const int mod=998
int i = 0, j = 0, k = 0, l = 0, h = 0, w = 0, a = 0, b = 0, c = 0, d = 0;
int num = 0, ans = 0, sum = 0;
const int N = 1e3 + 5;
void solve() {
	cin >> h >> w;
	vector<string>v(h);
	vector<mii>mp(3);
	vector<mii> ver(3);
	fr(0, h) {
		cin >> v[i];
		frj(0, w) {
			if (v[i][j] == 'I') {
				mp[1][i]++;
				ver[1][j]++;
			}
			else if (v[i][j] == 'O') {
				mp[2][i]++;
				ver[2][j]++;
			}
		}
	}
	fr(0, h) {
		frj(0, w) {
			if (v[i][j] == 'J') {
				ans += mp[2][i] * ver[1][j];
			}
			else if (v[i][j] == 'I') {
				mp[1][i]--;
				ver[1][j]--;
			}
			else {
				mp[2][i]--;
				ver[2][j]--;
			}
		}
	}
	cout << ans;
}
signed main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int T = 1;
	// cin >> T;
	while (T--) {
		cout << fixed << setprecision(12); solve();
		el;
	} return 0;
}

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