제출 #506355

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
506355		akshtsinghania	Collecting Mushrooms (NOI18_collectmushrooms)	C++14	100 / 100	22 ms	16992 KiB

mushrooms

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

#define int long long




void solve(){
	int r,c,d,k;
	cin>>r>>c>>d>>k;
	vector<vector<char>> g(r+1,vector<char>(c+2));
	vector<vector<int>> prefix(r+2,vector<int>(c+2));

	for(int i=1;i<=r;i++){
		for(int j=1;j<=c;j++){
			cin>>g[i][j];
			if(g[i][j]=='S'){
				int one=1;
				int start_x=max(one,i-d),start_y=max(one,j-d);
				int end_x=min(r+1,i+d+1),end_y=min(c+1,j+d+1);
				//cout<<start_x<<" "<<start_y<<" "<<end_x<<" "<<end_y<<endl;
				prefix[start_x][start_y]++;
				prefix[end_x][end_y]++;
				prefix[start_x][end_y]--;
				prefix[end_x][start_y]--;
			}
		}
	}
	for(int i=0;i<=r;i++){
		for(int j=0;j<=c;j++){
			if(i>0)prefix[i][j]+=prefix[i-1][j];
			if(j>0)prefix[i][j]+=prefix[i][j-1];
			if(j>0&&i>0)prefix[i][j]-=prefix[i-1][j-1];	
		}
	}
	int ans=0;
	for(int i=0;i<=r;i++){
		for(int j=0;j<=c;j++){
			//if(g[i][j]=='M')
				//cout<<"( "<<prefix[i][j]<<","<<i<<", "<<j<<" )"<<"\t";

			if(prefix[i][j]>=k&&g[i][j]=='M')
			{
				ans++;
			}
			//cout<<"( "<<prefix[i][j]<<","<<i<<", "<<j<<" )"<<"\t";
			//cout<<prefix[i][j]<<"\t";
		}
		//cout<<endl;
	}
	cout<<ans<<endl;

}

signed main(){
	cin.tie(NULL);
	cout.tie(NULL);
	//setIO("paintbarn");
	ios_base::sync_with_stdio(NULL);
	int t=1;
	//cin>>t;
	while(t--)solve();
	return 0;	
}
/*
4 4 4 1 
.... 
.M.. 
..MM 
...S
_____

5 5 1 1
....M 
.M... 
..S.. 
.S... 
...M.
______
1 8 5 2
SM..MM.S
*/

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 18 / 18
• Subtask 4: 23 / 23
• Subtask 5: 19 / 19
• Subtask 6: 21 / 21