Submission #624785

#	Time	Username	Problem	Language	Result	Execution time	Memory
624785		rm1729	Collecting Mushrooms (NOI18_collectmushrooms)	C++14	0 / 100	381 ms	262144 KiB

mushrooms

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

void solve(){
    int R, C;
    cin  >>R>>C;
    int D, K;
    cin >>D >>K;
    vector <vector <int>> pref(R+1, vector <int> (C+1,0));
    vector <pair<int,int>> loc;
    for(int i=1; i<=R; i++){
        string a;
        cin >>a;
        for(int j=1; j<=C; j++){
            char x = a[j-1];
            pref[i][j]=pref[i][j-1]+pref[i-1][j]-pref[i-1][j-1];
            if(x=='M') loc.push_back(make_pair(i,j));
            if(x=='S'){
                pref[i][j]++;
            } 
        }
    }
    int ans = 0;
    for(auto x: loc){
        pair <int,int> maxpos =make_pair(min(R,x.first+D), min(C,x.second+D));
        pair <int,int> minpos =make_pair(max(1ll,x.first-D), max(1ll,x.second-D));
        int n = pref[maxpos.first][maxpos.second]-pref[minpos.first-1][maxpos.second]-pref[maxpos.first][minpos.second-1]+pref[minpos.first-1][minpos.second-1];
        if(K<=n) ans++;
    }
    cout <<ans<<endl;
}

signed main(){
    int t; cin >>t;
    while(t--){
        solve();
    }
    return 0;
}

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