Submission #624080

#	Time	Username	Problem	Language	Result	Execution time	Memory
624080		PoonYaPat	Collecting Mushrooms (NOI18_collectmushrooms)	C++14	0 / 100	2 ms	852 KiB

mushrooms

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;

int n,m,d,k,ans;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>m>>d>>k;
    string s[n];
    for (int i=1; i<=n; ++i) {
        cin>>s[i];
        s[i]=" "+s[i];
    }
    int dp[n][m];
    memset(dp,0,sizeof(dp));

    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=m; ++j) {
            dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1];
            if (s[i][j]=='S') ++dp[i][j];
        }
    }

    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=m; ++j) {
            if (s[i][j]=='M') {
                if (dp[min(i+d,n)][min(j+d,m)]-dp[min(i+d,n)][max(0,j-d-1)]-dp[max(0,i-d-1)][min(j+d,m)]+dp[max(0,i-d-1)][max(0,j-d-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