Submission #465065

#	Time	Username	Problem	Language	Result	Execution time	Memory
465065		ohasanov	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	382 ms	85684 KiB

joi2019_ho_t1

#include "bits/stdc++.h"
using namespace std;
int ans[3005][3005];
char arr[3005][3005];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n,m;
    cin >> n >> m;
    vector<pair<int,int>> list;
    for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			cin >> arr[i][j];
		}
	}
	for(int j = m-1; j >= 0; j--){
		int o = 0;
		for(int i = n-1; i >= 0; i--){
			if(arr[i][j] == 'I') o++;
			if(arr[i][j] == 'J') {
				ans[i][j] = o;
			}
		}
	}
	for(int i = n-1; i >= 0; i--){
		int o = 0;
		for(int j = m-1; j >= 0; j--){
			if(arr[i][j] == 'O') o++;
			if(arr[i][j] == 'J') {
				list.push_back(make_pair(i,j));
				ans[i][j] *= o;
			}
		}
	}
	
	long long int ansss = 0;
	for(int i = 0; i < (int)list.size(); i++) ansss += ans[list[i].first][list[i].second];
	cout << ansss << endl;
	
    return 0;
}

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