Submission #878252

#	Time	Username	Problem	Language	Result	Execution time	Memory
878252		dsyz	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	224 ms	18000 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAXN (1000005)
int main() {
	ios_base::sync_with_stdio(false);cin.tie(0);
	ll H,W;
	cin>>H>>W;
	char arr[H][W];
	ll row[H]; //number of unvisited orbs in row i
	ll col[W]; //number of unvisited ingots in col j
	memset(row,0,sizeof(row));
	memset(col,0,sizeof(col));
	for(ll i = 0;i < H;i++){
		for(ll j = 0;j < W;j++){
			cin>>arr[i][j];
			if(arr[i][j] == 'O') row[i]++;
			if(arr[i][j] == 'I') col[j]++;
		}
	}
	ll sum = 0;
	for(ll i = 0;i < H;i++){
		for(ll j = 0;j < W;j++){
			if(arr[i][j] == 'J'){
				sum += row[i] * col[j];
			}else if(arr[i][j] == 'O'){
				row[i]--;
			}else if(arr[i][j] == 'I'){
				col[j]--;
			}
		}
	}
	cout<<sum<<'\n';
}

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