제출 #970319

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
970319		VMaksimoski008	Collecting Mushrooms (NOI18_collectmushrooms)	C++17	100 / 100	25 ms	7260 KiB

mushrooms

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

int main() {
    int n, m, d, k, ans = 0;
    cin >> n >> m >> d >> k;

    char mat[n+1][m+1];
    int P[n+2][m+2];
    memset(P, 0, sizeof(P));

    for(int i=1; i<=n; i++) {
        for(int j=1; j<=m; j++) {
            cin >> mat[i][j];
            if(mat[i][j] == 'S') {
                int x1 = max(1, i - d), x2 = min(n, i + d), y1 = max(1, j - d), y2 = min(m, j + d);
                P[x1][y1]++; P[x2+1][y2+1]++;
                P[x1][y2+1]--, P[x2+1][y1]--;
            }
        }
    }

    for(int i=1; i<=n; i++) {
        for(int j=1; j<=m; j++) {
            P[i][j] += P[i-1][j] + P[i][j-1];
            P[i][j] -= P[i-1][j-1];
            if(P[i][j] >= k && mat[i][j] == 'M') ans++;
        }
    }

    cout << ans << '\n';
    return 0;
}

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