제출 #705744

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
705744		myrcella	Bitaro the Brave (JOI19_ho_t1)	C++17	0 / 100	1 ms	1620 KiB

joi2019_ho_t1

//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

const int maxn = 3030;

int n,m;
int grid[maxn][maxn];
int cnt[2][maxn][maxn];

int main() {
//	freopen("input.txt","r",stdin);	
	std::ios::sync_with_stdio(false);cin.tie(0);
	cin>>n>>m;
	rep(i,0,n) {
		string s;cin>>s;
		rep(j,0,m) {
			if (s[j]=='I') grid[i][j]=1;
			else if (s[j]=='J') grid[i][j] = 2;
		}
	}
	for (int i= n-1;i>=0;i--)
		for (int j = m-1;j>=0;j--) {
			cnt[0][i][j] = cnt[0][i][j+1] + (grid[i][j]==0);
			cnt[1][i][j] = cnt[1][i+1][j] + (grid[i][j]==1);
		}
	ll ans = 0;
	rep(i,0,n)
		rep(j,0,n) {
			if (grid[i][j]==2) ans += cnt[0][i][j] * cnt[1][i][j];
		}
	cout<<ans;
	return 0;
}

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