Submission #372621

#	Time	Username	Problem	Language	Result	Execution time	Memory
372621		alishahali1382	Bitaro the Brave (JOI19_ho_t1)	C++14	100 / 100	307 ms	88812 KiB

joi2019_ho_t1

#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=3010, LOG=20;

ll ans; // :))
int n, m, k, u, v, x, y, t, a, b;
char A[MAXN][MAXN];
int I[MAXN][MAXN], O[MAXN][MAXN];

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m;
	for (int i=1; i<=n; i++) for (int j=1; j<=m; j++){
		cin>>A[i][j];
		if (A[i][j]=='I') I[i][j]=1;
		if (A[i][j]=='O') O[i][j]=1;
	}
	for (int i=n; i; i--) for (int j=m; j; j--){
		I[i][j]+=I[i+1][j];
		O[i][j]+=O[i][j+1];
		if (A[i][j]=='J') ans+=I[i][j]*O[i][j];
	}
	cout<<ans<<"\n";
	
	return 0;
}

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