제출 #208555

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
208555		huangqr	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	585 ms	108056 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
#define SZ 3005
using namespace std;
int h,w,rowo[SZ][SZ],coli[SZ][SZ];

int main() {
	long long sum=0;
	vector<pair<int,int> >coords;
	string s;
	cin>>h>>w;
	for(int i=1;i<=h;i++){
		cin>>s;
		for(int j=1;j<=w;j++){
			rowo[i][j]=rowo[i][j-1];
			coli[i][j]=coli[i-1][j];
			if(s[j-1]=='J')coords.emplace_back(i,j);
			else if(s[j-1]=='O')rowo[i][j]++;
			else if(s[j-1]=='I')coli[i][j]++;
		}
	}
/*	for(int i=1;i<=h;i++){
		for(int j=1;j<=w;j++){
			cout<<rowo[i][j]<<" ";
		}
		cout<<"\n";
	}
	cout<<"\n";
	for(int i=1;i<=h;i++){
		for(int j=1;j<=w;j++){
			cout<<coli[i][j]<<" ";
		}
		cout<<"\n";
	}*/
	for(auto x:coords){
		sum+=(rowo[x.first][w]-rowo[x.first][x.second])*(coli[h][x.second]-coli[x.first][x.second]);
	}
	cout<<sum;
	return 0;
}

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