제출 #94962

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

mushrooms

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

#define int long long

vector< vector<int> > Graph;
vector< vector<char> > graph;

void upd(int x, int y, int u, int v){
    Graph[x][y]++;
    Graph[x][v+1]--;
    Graph[u+1][y]--;
    Graph[u+1][v+1]++;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, d, k;
    cin >> n >> m >> d >> k;
    Graph.resize(n+2);
    graph.resize(n+2);
    for(int i = 0; i <= n+1; i++){
        Graph[i].resize(m+2);
        graph[i].resize(m+2);
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <=m; j++){
            cin >> graph[i][j];
            if(graph[i][j] == 'S'){
                upd(max(i-d,(int)1), max(j-d, (int)1), min(i+d,n), min(j+d,m));
            }
        }
    }
    int tot = 0;

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <=m; j++){
            Graph[i][j] += Graph[i][j-1] + Graph[i-1][j] - Graph[i-1][j-1];
            if(graph[i][j] == 'M' && Graph[i][j] >= k) tot++;
        }
    }
    cout << tot << endl;
}

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