Submission #766360

#	Time	Username	Problem	Language	Result	Execution time	Memory
766360		OrazB	Bitaro the Brave (JOI19_ho_t1)	C++17	100 / 100	289 ms	87400 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

int main ()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	vector<vector<char>> c(n+1, vector<char>(m+1));
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++) cin >> c[i][j];
	}
	vector<vector<int>> po(n+1, vector<int>(m+1, 0));
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++) po[i][j] = po[i][j-1]+(c[i][j] == 'O'); 
	}
	vector<vector<int>> pi(n+1, vector<int>(m+1, 0));
	for (int i = 1; i <= m; i++){
		for (int j = 1; j <= n; j++){
			pi[j][i] = pi[j-1][i]+(c[j][i] == 'I');
		}
	}
	ll ans = 0;
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++){
			if (c[i][j] == 'J'){
				ans += (po[i][m]-po[i][j])*(pi[n][j]-pi[i][j]);
			}
		}
	}
	cout << ans;
}	

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