제출 #227613

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
227613		Autoratch	Collecting Mushrooms (NOI18_collectmushrooms)	C++14	100 / 100	19 ms	7168 KiB

mushrooms

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

int m,n,d,k,ans;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> m >> n >> d >> k;
    int a[m+2][n+2];
    char c[m+1][n+1];
    for(int i = 1;i <= m;i++) for(int j = 1;j <= n;j++) cin >> c[i][j];
    for(int i = 0;i <= m;i++) for(int j = 0;j <= n;j++) a[i][j] = 0;
    for(int i = 1;i <= m;i++) for(int j = 1;j <= n;j++) if(c[i][j]=='S') 
        a[max(1,i-d)][max(1,j-d)]++,a[min(m,i+d)+1][max(1,j-d)]--,a[max(1,i-d)][min(n,j+d)+1]--,a[min(m,i+d)+1][min(n,j+d)+1]++;
    for(int i = 1;i <= m;i++) for(int j = 1;j <= n;j++) a[i][j]+=a[i-1][j]+a[i][j-1]-a[i-1][j-1];
    for(int i = 1;i <= m;i++) for(int j = 1;j <= n;j++) if(c[i][j]=='M' and a[i][j]>=k) ans++;
    cout << ans;
}

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