제출 #546925

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
546925		Ahmed57	Collecting Mushrooms (NOI18_collectmushrooms)	C++14	0 / 100	14 ms	9044 KiB

mushrooms

#include <bits/stdc++.h>

using namespace std;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n,m,d,k;
	cin>>n>>m>>d>>k;
	char arr[n+1][m+1];
	int pre[n+1][m+1];
    int fores[n+1][m+1];
    memset(pre,0,sizeof pre);
    memset(fores,0,sizeof fores);
	for(int i=1;i<=n;i++) {
		for(int j=1;j<=m;j++) {
			char a;
			cin>>a;
			arr[i][j] = a;
			if(a=='S'){
                fores[max(i-d,1)][max(j-d,1)]++;
                fores[min(i+d,n)][min(j+d,m)]--;
			}
		}
	}
	for(int i=1;i<=n;i++) {
		for(int j=1;j<=m;j++) {
			pre[i][j]=fores[i][j]+pre[i-1][j]+pre[i][j-1]-pre[i-1][j-1];
		}
	}
	int ans=0;
	for(int i = 1;i<=n;i++){
        for(int j = 1;j<=m;j++){
            if(arr[i][j]=='M'&&pre[i][j]-pre[i-1][j]-pre[i][j-1]+pre[i-1][j-1]>=k){
            ans++;
            }
	    }
	}
	cout<<ans;
}

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